./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd --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 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:58:35,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:58:36,021 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:58:36,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:58:36,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:58:36,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:58:36,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:58:36,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:58:36,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:58:36,059 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:58:36,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:58:36,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:58:36,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:58:36,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:58:36,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:58:36,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:58:36,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:58:36,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:58:36,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:58:36,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:58:36,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:58:36,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:58:36,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:58:36,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:58:36,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:58:36,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:58:36,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:58:36,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:58:36,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:58:36,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:58:36,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:58:36,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:58:36,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:58:36,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:58:36,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:58:36,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:58:36,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:58:36,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:58:36,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:58:36,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:58:36,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:58:36,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:58:36,070 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_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd 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 -> 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 [2024-11-13 14:58:36,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:58:36,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:58:36,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:58:36,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:58:36,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:58:36,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i Unable to find full path for "g++" [2024-11-13 14:58:38,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:58:39,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:58:39,133 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-13 14:58:39,152 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/data/f719ae6b8/063e33b8e5ab4aa299f5793b5d0cedae/FLAGf92323830 [2024-11-13 14:58:39,175 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/data/f719ae6b8/063e33b8e5ab4aa299f5793b5d0cedae [2024-11-13 14:58:39,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:58:39,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:58:39,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:58:39,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:58:39,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:58:39,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16312a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39, skipping insertion in model container [2024-11-13 14:58:39,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:58:39,453 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_0ffd586e-bafb-48c4-be44-1ad59e6e0945/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-11-13 14:58:39,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:58:39,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:58:39,616 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_0ffd586e-bafb-48c4-be44-1ad59e6e0945/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-11-13 14:58:39,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:58:39,739 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:58:39,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39 WrapperNode [2024-11-13 14:58:39,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:58:39,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:58:39,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:58:39,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:58:39,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,825 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2024-11-13 14:58:39,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:58:39,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:58:39,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:58:39,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:58:39,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,867 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-11-13 14:58:39,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:58:39,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:58:39,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:58:39,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:58:39,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (1/1) ... [2024-11-13 14:58:39,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:58:39,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:58:39,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:58:39,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:58:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 14:58:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:58:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:58:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:58:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 14:58:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 14:58:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 14:58:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 14:58:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 14:58:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 14:58:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 14:58:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 14:58:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 14:58:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:58:40,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:58:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:58:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:58:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:58:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 14:58:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 14:58:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 14:58:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:58:40,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:58:40,263 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:58:40,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:58:41,118 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-13 14:58:41,118 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:58:41,143 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:58:41,145 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:58:41,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:58:41 BoogieIcfgContainer [2024-11-13 14:58:41,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:58:41,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:58:41,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:58:41,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:58:41,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:58:39" (1/3) ... [2024-11-13 14:58:41,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180abfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:58:41, skipping insertion in model container [2024-11-13 14:58:41,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:58:39" (2/3) ... [2024-11-13 14:58:41,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180abfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:58:41, skipping insertion in model container [2024-11-13 14:58:41,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:58:41" (3/3) ... [2024-11-13 14:58:41,164 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-13 14:58:41,186 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:58:41,188 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-15.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:58:41,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:58:41,288 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;@6dcb7a7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:58:41,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:58:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:58:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:58:41,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:41,312 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:41,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 357738169, now seen corresponding path program 1 times [2024-11-13 14:58:41,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854793862] [2024-11-13 14:58:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:41,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854793862] [2024-11-13 14:58:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854793862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:41,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:41,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:58:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747902522] [2024-11-13 14:58:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:41,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:58:41,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:41,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:58:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:58:41,960 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:58:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:41,997 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-13 14:58:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:58:41,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-13 14:58:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:42,008 INFO L225 Difference]: With dead ends: 219 [2024-11-13 14:58:42,009 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 14:58:42,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-13 14:58:42,016 INFO L432 NwaCegarLoop]: 157 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, 157 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-13 14:58:42,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:58:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 14:58:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 14:58:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:58:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-13 14:58:42,067 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-13 14:58:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:42,068 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-13 14:58:42,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:58:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-13 14:58:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:58:42,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:42,073 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:42,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:58:42,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:42,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1502558233, now seen corresponding path program 1 times [2024-11-13 14:58:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402241096] [2024-11-13 14:58:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:42,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:42,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402241096] [2024-11-13 14:58:42,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402241096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:42,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:42,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:58:42,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910989823] [2024-11-13 14:58:42,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:58:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:58:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:58:42,577 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:42,630 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-13 14:58:42,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:58:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:58:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:42,633 INFO L225 Difference]: With dead ends: 216 [2024-11-13 14:58:42,633 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 14:58:42,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:58:42,635 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:42,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:58:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 14:58:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-13 14:58:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:58:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-13 14:58:42,650 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 115 [2024-11-13 14:58:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-13 14:58:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-13 14:58:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:58:42,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:42,656 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:42,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:58:42,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:42,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1103465321, now seen corresponding path program 1 times [2024-11-13 14:58:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:42,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370759583] [2024-11-13 14:58:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370759583] [2024-11-13 14:58:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370759583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:58:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583607836] [2024-11-13 14:58:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:58:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:58:43,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:58:43,194 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:43,250 INFO L93 Difference]: Finished difference Result 215 states and 310 transitions. [2024-11-13 14:58:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:58:43,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:58:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:43,253 INFO L225 Difference]: With dead ends: 215 [2024-11-13 14:58:43,256 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 14:58:43,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:58:43,258 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:43,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:58:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 14:58:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-13 14:58:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:58:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-13 14:58:43,287 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 115 [2024-11-13 14:58:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:43,287 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-13 14:58:43,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-13 14:58:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:58:43,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:43,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:43,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:58:43,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:43,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash 975301554, now seen corresponding path program 1 times [2024-11-13 14:58:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:43,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490355891] [2024-11-13 14:58:43,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:43,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:43,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490355891] [2024-11-13 14:58:43,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490355891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:43,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:43,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:58:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018475347] [2024-11-13 14:58:43,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:43,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:58:43,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:43,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:58:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:58:43,570 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:43,636 INFO L93 Difference]: Finished difference Result 214 states and 307 transitions. [2024-11-13 14:58:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:58:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:58:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:43,641 INFO L225 Difference]: With dead ends: 214 [2024-11-13 14:58:43,641 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 14:58:43,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:58:43,646 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:43,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:58:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 14:58:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 14:58:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:58:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-11-13 14:58:43,668 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 115 [2024-11-13 14:58:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:43,669 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-11-13 14:58:43,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-11-13 14:58:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:58:43,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:43,677 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:43,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:58:43,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:43,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:43,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1233466992, now seen corresponding path program 1 times [2024-11-13 14:58:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:43,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443288863] [2024-11-13 14:58:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:44,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:44,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443288863] [2024-11-13 14:58:44,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443288863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:44,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:44,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:58:44,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117654342] [2024-11-13 14:58:44,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:44,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:58:44,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:44,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:58:44,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:58:44,663 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:44,841 INFO L93 Difference]: Finished difference Result 321 states and 459 transitions. [2024-11-13 14:58:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:58:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:58:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:44,844 INFO L225 Difference]: With dead ends: 321 [2024-11-13 14:58:44,844 INFO L226 Difference]: Without dead ends: 215 [2024-11-13 14:58:44,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:58:44,848 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 239 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:44,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 428 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:58:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-13 14:58:44,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2024-11-13 14:58:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 183 states have (on average 1.3825136612021858) internal successors, (253), 183 states have internal predecessors, (253), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:58:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2024-11-13 14:58:44,908 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 115 [2024-11-13 14:58:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:44,908 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2024-11-13 14:58:44,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2024-11-13 14:58:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 14:58:44,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:44,911 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:44,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:58:44,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:44,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1630214305, now seen corresponding path program 1 times [2024-11-13 14:58:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881587376] [2024-11-13 14:58:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881587376] [2024-11-13 14:58:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881587376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:45,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:45,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:58:45,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199526370] [2024-11-13 14:58:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:45,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:58:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:58:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:58:45,731 INFO L87 Difference]: Start difference. First operand 210 states and 301 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:46,034 INFO L93 Difference]: Finished difference Result 421 states and 603 transitions. [2024-11-13 14:58:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:58:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 14:58:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:46,038 INFO L225 Difference]: With dead ends: 421 [2024-11-13 14:58:46,038 INFO L226 Difference]: Without dead ends: 214 [2024-11-13 14:58:46,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:58:46,040 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 148 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:46,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 797 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:58:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-13 14:58:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2024-11-13 14:58:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:58:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 299 transitions. [2024-11-13 14:58:46,061 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 299 transitions. Word has length 116 [2024-11-13 14:58:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:46,062 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 299 transitions. [2024-11-13 14:58:46,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 299 transitions. [2024-11-13 14:58:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 14:58:46,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:46,065 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:46,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:58:46,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:46,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash -167850613, now seen corresponding path program 1 times [2024-11-13 14:58:46,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:46,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242226203] [2024-11-13 14:58:46,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:46,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242226203] [2024-11-13 14:58:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242226203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:58:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859293056] [2024-11-13 14:58:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:46,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:58:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:58:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:58:46,958 INFO L87 Difference]: Start difference. First operand 209 states and 299 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:47,312 INFO L93 Difference]: Finished difference Result 478 states and 683 transitions. [2024-11-13 14:58:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:58:47,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-13 14:58:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:47,316 INFO L225 Difference]: With dead ends: 478 [2024-11-13 14:58:47,316 INFO L226 Difference]: Without dead ends: 372 [2024-11-13 14:58:47,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:58:47,318 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 207 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:47,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 792 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:58:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-13 14:58:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2024-11-13 14:58:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 323 states have (on average 1.3839009287925697) internal successors, (447), 325 states have internal predecessors, (447), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:58:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 527 transitions. [2024-11-13 14:58:47,367 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 527 transitions. Word has length 117 [2024-11-13 14:58:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:47,367 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 527 transitions. [2024-11-13 14:58:47,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 527 transitions. [2024-11-13 14:58:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 14:58:47,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:47,371 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:47,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:58:47,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:47,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1878599341, now seen corresponding path program 1 times [2024-11-13 14:58:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:47,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919452011] [2024-11-13 14:58:47,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:47,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:47,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919452011] [2024-11-13 14:58:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919452011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:58:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636230899] [2024-11-13 14:58:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:47,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:58:47,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:58:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:58:47,851 INFO L87 Difference]: Start difference. First operand 368 states and 527 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:48,046 INFO L93 Difference]: Finished difference Result 900 states and 1288 transitions. [2024-11-13 14:58:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:58:48,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 14:58:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:48,052 INFO L225 Difference]: With dead ends: 900 [2024-11-13 14:58:48,052 INFO L226 Difference]: Without dead ends: 535 [2024-11-13 14:58:48,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:58:48,054 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 110 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:48,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 970 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:58:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-13 14:58:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 389. [2024-11-13 14:58:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 344 states have (on average 1.380813953488372) internal successors, (475), 346 states have internal predecessors, (475), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:58:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 555 transitions. [2024-11-13 14:58:48,094 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 555 transitions. Word has length 118 [2024-11-13 14:58:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:48,095 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 555 transitions. [2024-11-13 14:58:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 555 transitions. [2024-11-13 14:58:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 14:58:48,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:48,098 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:48,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:58:48,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:48,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2121387100, now seen corresponding path program 1 times [2024-11-13 14:58:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224303268] [2024-11-13 14:58:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224303268] [2024-11-13 14:58:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224303268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:48,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:58:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191395252] [2024-11-13 14:58:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:48,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:58:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:58:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:58:48,592 INFO L87 Difference]: Start difference. First operand 389 states and 555 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:48,775 INFO L93 Difference]: Finished difference Result 975 states and 1382 transitions. [2024-11-13 14:58:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:58:48,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 14:58:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:48,781 INFO L225 Difference]: With dead ends: 975 [2024-11-13 14:58:48,781 INFO L226 Difference]: Without dead ends: 589 [2024-11-13 14:58:48,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:58:48,788 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 59 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:48,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 657 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:58:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-13 14:58:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 442. [2024-11-13 14:58:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 397 states have (on average 1.3702770780856424) internal successors, (544), 399 states have internal predecessors, (544), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:58:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 624 transitions. [2024-11-13 14:58:48,866 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 624 transitions. Word has length 118 [2024-11-13 14:58:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:48,867 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 624 transitions. [2024-11-13 14:58:48,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 624 transitions. [2024-11-13 14:58:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 14:58:48,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:48,869 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:48,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:58:48,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:48,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 224721115, now seen corresponding path program 1 times [2024-11-13 14:58:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372335850] [2024-11-13 14:58:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:49,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372335850] [2024-11-13 14:58:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372335850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:49,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:49,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:58:49,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920793158] [2024-11-13 14:58:49,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:49,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:58:49,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:58:49,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:58:49,328 INFO L87 Difference]: Start difference. First operand 442 states and 624 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:49,490 INFO L93 Difference]: Finished difference Result 1024 states and 1441 transitions. [2024-11-13 14:58:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:58:49,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 14:58:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:49,496 INFO L225 Difference]: With dead ends: 1024 [2024-11-13 14:58:49,496 INFO L226 Difference]: Without dead ends: 585 [2024-11-13 14:58:49,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:58:49,509 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 66 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:49,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 629 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:58:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-13 14:58:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 441. [2024-11-13 14:58:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3661616161616161) internal successors, (541), 398 states have internal predecessors, (541), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:58:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 621 transitions. [2024-11-13 14:58:49,559 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 621 transitions. Word has length 118 [2024-11-13 14:58:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:49,559 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 621 transitions. [2024-11-13 14:58:49,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 621 transitions. [2024-11-13 14:58:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 14:58:49,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:49,562 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:58:49,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -592927335, now seen corresponding path program 1 times [2024-11-13 14:58:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672329143] [2024-11-13 14:58:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:50,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672329143] [2024-11-13 14:58:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672329143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:50,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:50,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:58:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163217147] [2024-11-13 14:58:50,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:50,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:58:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:50,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:58:50,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:58:50,233 INFO L87 Difference]: Start difference. First operand 441 states and 621 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:50,491 INFO L93 Difference]: Finished difference Result 888 states and 1249 transitions. [2024-11-13 14:58:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:58:50,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 14:58:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:50,496 INFO L225 Difference]: With dead ends: 888 [2024-11-13 14:58:50,497 INFO L226 Difference]: Without dead ends: 664 [2024-11-13 14:58:50,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:58:50,498 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 166 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:50,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 718 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:58:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-11-13 14:58:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 640. [2024-11-13 14:58:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 573 states have (on average 1.3630017452006982) internal successors, (781), 576 states have internal predecessors, (781), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:58:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 901 transitions. [2024-11-13 14:58:50,556 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 901 transitions. Word has length 118 [2024-11-13 14:58:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:50,557 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 901 transitions. [2024-11-13 14:58:50,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 901 transitions. [2024-11-13 14:58:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 14:58:50,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:50,560 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:50,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:58:50,560 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:50,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash 658363501, now seen corresponding path program 1 times [2024-11-13 14:58:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:50,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987068743] [2024-11-13 14:58:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:50,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:50,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:50,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987068743] [2024-11-13 14:58:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987068743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:50,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:58:50,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40422620] [2024-11-13 14:58:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:58:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:50,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:58:50,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:58:50,898 INFO L87 Difference]: Start difference. First operand 640 states and 901 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:51,087 INFO L93 Difference]: Finished difference Result 1360 states and 1913 transitions. [2024-11-13 14:58:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:58:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 14:58:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:51,092 INFO L225 Difference]: With dead ends: 1360 [2024-11-13 14:58:51,092 INFO L226 Difference]: Without dead ends: 723 [2024-11-13 14:58:51,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:58:51,094 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 69 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:51,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 639 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:58:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-13 14:58:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 605. [2024-11-13 14:58:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 538 states have (on average 1.3661710037174721) internal successors, (735), 541 states have internal predecessors, (735), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:58:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 855 transitions. [2024-11-13 14:58:51,160 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 855 transitions. Word has length 119 [2024-11-13 14:58:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:51,160 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 855 transitions. [2024-11-13 14:58:51,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 855 transitions. [2024-11-13 14:58:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 14:58:51,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:51,164 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:51,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:58:51,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:51,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:51,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1001397121, now seen corresponding path program 1 times [2024-11-13 14:58:51,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:51,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55410209] [2024-11-13 14:58:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:51,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55410209] [2024-11-13 14:58:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55410209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:58:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878878693] [2024-11-13 14:58:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:58:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:58:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:58:51,577 INFO L87 Difference]: Start difference. First operand 605 states and 855 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:51,735 INFO L93 Difference]: Finished difference Result 1038 states and 1464 transitions. [2024-11-13 14:58:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:58:51,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 14:58:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:51,753 INFO L225 Difference]: With dead ends: 1038 [2024-11-13 14:58:51,754 INFO L226 Difference]: Without dead ends: 623 [2024-11-13 14:58:51,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:58:51,758 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 64 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:51,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 713 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:58:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-13 14:58:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 584. [2024-11-13 14:58:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 517 states have (on average 1.367504835589942) internal successors, (707), 520 states have internal predecessors, (707), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:58:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 827 transitions. [2024-11-13 14:58:51,829 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 827 transitions. Word has length 119 [2024-11-13 14:58:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:51,829 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 827 transitions. [2024-11-13 14:58:51,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 827 transitions. [2024-11-13 14:58:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 14:58:51,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:51,832 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:51,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:58:51,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:51,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1432164200, now seen corresponding path program 1 times [2024-11-13 14:58:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794155744] [2024-11-13 14:58:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:51,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794155744] [2024-11-13 14:58:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794155744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:52,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:58:52,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419882445] [2024-11-13 14:58:52,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:52,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:58:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:52,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:58:52,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:58:52,299 INFO L87 Difference]: Start difference. First operand 584 states and 827 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:52,465 INFO L93 Difference]: Finished difference Result 1203 states and 1701 transitions. [2024-11-13 14:58:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:58:52,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 14:58:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:52,473 INFO L225 Difference]: With dead ends: 1203 [2024-11-13 14:58:52,473 INFO L226 Difference]: Without dead ends: 622 [2024-11-13 14:58:52,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:58:52,477 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 58 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:52,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 565 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:58:52,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-13 14:58:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 584. [2024-11-13 14:58:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 517 states have (on average 1.3539651837524178) internal successors, (700), 520 states have internal predecessors, (700), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:58:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 820 transitions. [2024-11-13 14:58:52,557 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 820 transitions. Word has length 119 [2024-11-13 14:58:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:52,557 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 820 transitions. [2024-11-13 14:58:52,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 820 transitions. [2024-11-13 14:58:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 14:58:52,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:52,560 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:52,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:58:52,561 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:52,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1851685846, now seen corresponding path program 1 times [2024-11-13 14:58:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812720985] [2024-11-13 14:58:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:54,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:54,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812720985] [2024-11-13 14:58:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812720985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:54,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:54,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:58:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899709825] [2024-11-13 14:58:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:54,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:58:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:58:54,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:58:54,198 INFO L87 Difference]: Start difference. First operand 584 states and 820 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:56,065 INFO L93 Difference]: Finished difference Result 1302 states and 1827 transitions. [2024-11-13 14:58:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:58:56,066 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 14:58:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:56,071 INFO L225 Difference]: With dead ends: 1302 [2024-11-13 14:58:56,071 INFO L226 Difference]: Without dead ends: 721 [2024-11-13 14:58:56,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:58:56,074 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 417 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:56,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 2287 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 14:58:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-13 14:58:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 707. [2024-11-13 14:58:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 617 states have (on average 1.3517017828200972) internal successors, (834), 622 states have internal predecessors, (834), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 14:58:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 994 transitions. [2024-11-13 14:58:56,181 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 994 transitions. Word has length 119 [2024-11-13 14:58:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:56,181 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 994 transitions. [2024-11-13 14:58:56,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 994 transitions. [2024-11-13 14:58:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 14:58:56,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:56,184 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:56,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:58:56,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:56,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1997363558, now seen corresponding path program 1 times [2024-11-13 14:58:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848760118] [2024-11-13 14:58:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:56,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848760118] [2024-11-13 14:58:56,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848760118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:56,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:56,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:58:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161935496] [2024-11-13 14:58:56,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:56,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:58:56,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:58:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:58:56,619 INFO L87 Difference]: Start difference. First operand 707 states and 994 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:56,795 INFO L93 Difference]: Finished difference Result 1223 states and 1711 transitions. [2024-11-13 14:58:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:58:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 14:58:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:56,804 INFO L225 Difference]: With dead ends: 1223 [2024-11-13 14:58:56,804 INFO L226 Difference]: Without dead ends: 806 [2024-11-13 14:58:56,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:58:56,806 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 133 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:56,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 818 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:58:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-13 14:58:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 796. [2024-11-13 14:58:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 692 states have (on average 1.346820809248555) internal successors, (932), 697 states have internal predecessors, (932), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:58:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1116 transitions. [2024-11-13 14:58:56,912 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1116 transitions. Word has length 119 [2024-11-13 14:58:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:56,913 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1116 transitions. [2024-11-13 14:58:56,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:58:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1116 transitions. [2024-11-13 14:58:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 14:58:56,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:56,916 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:58:56,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:58:56,916 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash -527847125, now seen corresponding path program 1 times [2024-11-13 14:58:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003319477] [2024-11-13 14:58:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:58:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:58:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:58:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:58:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:58:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:58:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:58:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:58:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:58:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:58:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:58:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:58:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:58:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:58,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003319477] [2024-11-13 14:58:58,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003319477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:58:58,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:58:58,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:58:58,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126795394] [2024-11-13 14:58:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:58:58,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:58:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:58,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:58:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:58:58,390 INFO L87 Difference]: Start difference. First operand 796 states and 1116 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:00,113 INFO L93 Difference]: Finished difference Result 1557 states and 2173 transitions. [2024-11-13 14:59:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:59:00,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-13 14:59:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:00,121 INFO L225 Difference]: With dead ends: 1557 [2024-11-13 14:59:00,121 INFO L226 Difference]: Without dead ends: 805 [2024-11-13 14:59:00,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:59:00,125 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 447 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:00,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2221 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 14:59:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-13 14:59:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 791. [2024-11-13 14:59:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 687 states have (on average 1.3449781659388647) internal successors, (924), 692 states have internal predecessors, (924), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:59:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1108 transitions. [2024-11-13 14:59:00,286 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1108 transitions. Word has length 120 [2024-11-13 14:59:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1108 transitions. [2024-11-13 14:59:00,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1108 transitions. [2024-11-13 14:59:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:59:00,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:00,291 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:00,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:59:00,292 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:00,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1083205128, now seen corresponding path program 1 times [2024-11-13 14:59:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:00,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679653027] [2024-11-13 14:59:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:00,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:00,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679653027] [2024-11-13 14:59:01,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679653027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:01,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:01,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:59:01,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294693476] [2024-11-13 14:59:01,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:01,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:59:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:59:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:59:01,042 INFO L87 Difference]: Start difference. First operand 791 states and 1108 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:01,491 INFO L93 Difference]: Finished difference Result 1435 states and 2007 transitions. [2024-11-13 14:59:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:59:01,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 14:59:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:01,497 INFO L225 Difference]: With dead ends: 1435 [2024-11-13 14:59:01,497 INFO L226 Difference]: Without dead ends: 952 [2024-11-13 14:59:01,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:59:01,499 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 121 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:01,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 982 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:59:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-11-13 14:59:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 947. [2024-11-13 14:59:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 819 states have (on average 1.343101343101343) internal successors, (1100), 826 states have internal predecessors, (1100), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 14:59:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1324 transitions. [2024-11-13 14:59:01,639 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1324 transitions. Word has length 121 [2024-11-13 14:59:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:01,640 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1324 transitions. [2024-11-13 14:59:01,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1324 transitions. [2024-11-13 14:59:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:59:01,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:01,643 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:01,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 14:59:01,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:01,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:01,644 INFO L85 PathProgramCache]: Analyzing trace with hash -618556933, now seen corresponding path program 1 times [2024-11-13 14:59:01,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:01,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066223174] [2024-11-13 14:59:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:01,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066223174] [2024-11-13 14:59:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066223174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:02,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:59:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18038710] [2024-11-13 14:59:02,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:59:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:02,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:59:02,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:59:02,282 INFO L87 Difference]: Start difference. First operand 947 states and 1324 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:02,856 INFO L93 Difference]: Finished difference Result 1875 states and 2611 transitions. [2024-11-13 14:59:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:59:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 14:59:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:02,864 INFO L225 Difference]: With dead ends: 1875 [2024-11-13 14:59:02,865 INFO L226 Difference]: Without dead ends: 972 [2024-11-13 14:59:02,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:59:02,868 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 204 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:02,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1216 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:59:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-11-13 14:59:03,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 961. [2024-11-13 14:59:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 833 states have (on average 1.333733493397359) internal successors, (1111), 840 states have internal predecessors, (1111), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 14:59:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1335 transitions. [2024-11-13 14:59:03,071 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1335 transitions. Word has length 121 [2024-11-13 14:59:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:03,072 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1335 transitions. [2024-11-13 14:59:03,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1335 transitions. [2024-11-13 14:59:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:59:03,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:03,075 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:03,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 14:59:03,075 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:03,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash -399702215, now seen corresponding path program 1 times [2024-11-13 14:59:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176785117] [2024-11-13 14:59:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:03,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176785117] [2024-11-13 14:59:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176785117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:03,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:03,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:59:03,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448862775] [2024-11-13 14:59:03,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:03,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:59:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:03,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:59:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:59:03,402 INFO L87 Difference]: Start difference. First operand 961 states and 1335 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:03,643 INFO L93 Difference]: Finished difference Result 1868 states and 2590 transitions. [2024-11-13 14:59:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:59:03,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 14:59:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:03,651 INFO L225 Difference]: With dead ends: 1868 [2024-11-13 14:59:03,651 INFO L226 Difference]: Without dead ends: 951 [2024-11-13 14:59:03,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:59:03,655 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 46 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:03,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 701 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:59:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-13 14:59:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 949. [2024-11-13 14:59:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 821 states have (on average 1.3313032886723508) internal successors, (1093), 828 states have internal predecessors, (1093), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 14:59:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1317 transitions. [2024-11-13 14:59:03,783 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1317 transitions. Word has length 121 [2024-11-13 14:59:03,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:03,784 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1317 transitions. [2024-11-13 14:59:03,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1317 transitions. [2024-11-13 14:59:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:59:03,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:03,787 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:03,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 14:59:03,788 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:03,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:03,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1421769075, now seen corresponding path program 1 times [2024-11-13 14:59:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:03,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370080647] [2024-11-13 14:59:03,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:03,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370080647] [2024-11-13 14:59:04,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370080647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:04,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:59:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677773943] [2024-11-13 14:59:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:04,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:59:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:04,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:59:04,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:59:04,164 INFO L87 Difference]: Start difference. First operand 949 states and 1317 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:04,360 INFO L93 Difference]: Finished difference Result 1842 states and 2555 transitions. [2024-11-13 14:59:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:59:04,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 14:59:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:04,368 INFO L225 Difference]: With dead ends: 1842 [2024-11-13 14:59:04,368 INFO L226 Difference]: Without dead ends: 937 [2024-11-13 14:59:04,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:59:04,371 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 51 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:04,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 570 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:59:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-13 14:59:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 935. [2024-11-13 14:59:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 807 states have (on average 1.3283767038413878) internal successors, (1072), 814 states have internal predecessors, (1072), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 14:59:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1296 transitions. [2024-11-13 14:59:04,487 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1296 transitions. Word has length 121 [2024-11-13 14:59:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:04,488 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1296 transitions. [2024-11-13 14:59:04,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1296 transitions. [2024-11-13 14:59:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:59:04,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:04,490 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:04,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 14:59:04,491 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:04,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1021339196, now seen corresponding path program 1 times [2024-11-13 14:59:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92599485] [2024-11-13 14:59:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92599485] [2024-11-13 14:59:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92599485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:04,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:59:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486500397] [2024-11-13 14:59:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:04,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:59:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:59:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:59:04,806 INFO L87 Difference]: Start difference. First operand 935 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:05,024 INFO L93 Difference]: Finished difference Result 1568 states and 2169 transitions. [2024-11-13 14:59:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:59:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 14:59:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:05,034 INFO L225 Difference]: With dead ends: 1568 [2024-11-13 14:59:05,034 INFO L226 Difference]: Without dead ends: 935 [2024-11-13 14:59:05,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:59:05,039 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 62 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:05,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 638 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:59:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-13 14:59:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 933. [2024-11-13 14:59:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 805 states have (on average 1.3229813664596273) internal successors, (1065), 812 states have internal predecessors, (1065), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-13 14:59:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1289 transitions. [2024-11-13 14:59:05,166 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1289 transitions. Word has length 121 [2024-11-13 14:59:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:05,167 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1289 transitions. [2024-11-13 14:59:05,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1289 transitions. [2024-11-13 14:59:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 14:59:05,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:05,171 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:05,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 14:59:05,171 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:05,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1160259069, now seen corresponding path program 1 times [2024-11-13 14:59:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:05,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644878828] [2024-11-13 14:59:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:06,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644878828] [2024-11-13 14:59:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644878828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:06,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:06,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:59:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346970069] [2024-11-13 14:59:06,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:06,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:59:06,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:59:06,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:59:06,292 INFO L87 Difference]: Start difference. First operand 933 states and 1289 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:06,991 INFO L93 Difference]: Finished difference Result 1569 states and 2155 transitions. [2024-11-13 14:59:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:59:06,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 14:59:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:06,999 INFO L225 Difference]: With dead ends: 1569 [2024-11-13 14:59:06,999 INFO L226 Difference]: Without dead ends: 938 [2024-11-13 14:59:07,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:59:07,002 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 339 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:07,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 610 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:59:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-13 14:59:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 630. [2024-11-13 14:59:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 545 states have (on average 1.3137614678899083) internal successors, (716), 549 states have internal predecessors, (716), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 14:59:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 860 transitions. [2024-11-13 14:59:07,114 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 860 transitions. Word has length 122 [2024-11-13 14:59:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:07,115 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 860 transitions. [2024-11-13 14:59:07,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 860 transitions. [2024-11-13 14:59:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 14:59:07,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:07,118 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:07,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 14:59:07,118 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:07,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753450, now seen corresponding path program 1 times [2024-11-13 14:59:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731440145] [2024-11-13 14:59:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731440145] [2024-11-13 14:59:08,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731440145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:59:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299733205] [2024-11-13 14:59:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:59:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:59:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:59:08,659 INFO L87 Difference]: Start difference. First operand 630 states and 860 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:10,472 INFO L93 Difference]: Finished difference Result 1903 states and 2589 transitions. [2024-11-13 14:59:10,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:59:10,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 14:59:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:10,482 INFO L225 Difference]: With dead ends: 1903 [2024-11-13 14:59:10,482 INFO L226 Difference]: Without dead ends: 1276 [2024-11-13 14:59:10,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:59:10,486 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 477 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:10,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1729 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:59:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-13 14:59:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 951. [2024-11-13 14:59:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 831 states have (on average 1.3020457280385078) internal successors, (1082), 837 states have internal predecessors, (1082), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1286 transitions. [2024-11-13 14:59:10,691 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1286 transitions. Word has length 122 [2024-11-13 14:59:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:10,692 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1286 transitions. [2024-11-13 14:59:10,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1286 transitions. [2024-11-13 14:59:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 14:59:10,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:10,695 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 14:59:10,695 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:10,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2015149268, now seen corresponding path program 1 times [2024-11-13 14:59:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:10,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047633065] [2024-11-13 14:59:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:11,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:11,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047633065] [2024-11-13 14:59:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047633065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:11,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:11,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:59:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839989761] [2024-11-13 14:59:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:11,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:59:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:11,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:59:11,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:59:11,634 INFO L87 Difference]: Start difference. First operand 951 states and 1286 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:12,749 INFO L93 Difference]: Finished difference Result 2212 states and 2997 transitions. [2024-11-13 14:59:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:59:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 14:59:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:12,764 INFO L225 Difference]: With dead ends: 2212 [2024-11-13 14:59:12,764 INFO L226 Difference]: Without dead ends: 1264 [2024-11-13 14:59:12,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:59:12,767 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 424 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:12,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1070 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:59:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2024-11-13 14:59:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 951. [2024-11-13 14:59:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 831 states have (on average 1.2984356197352587) internal successors, (1079), 837 states have internal predecessors, (1079), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1283 transitions. [2024-11-13 14:59:12,953 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1283 transitions. Word has length 122 [2024-11-13 14:59:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:12,957 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1283 transitions. [2024-11-13 14:59:12,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1283 transitions. [2024-11-13 14:59:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 14:59:12,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:12,960 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:12,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 14:59:12,960 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:12,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2014613972, now seen corresponding path program 1 times [2024-11-13 14:59:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:12,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968244235] [2024-11-13 14:59:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:13,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968244235] [2024-11-13 14:59:13,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968244235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:13,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:13,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:59:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615840229] [2024-11-13 14:59:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:59:13,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:59:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:59:13,890 INFO L87 Difference]: Start difference. First operand 951 states and 1283 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:14,706 INFO L93 Difference]: Finished difference Result 2079 states and 2798 transitions. [2024-11-13 14:59:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:59:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 14:59:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:14,713 INFO L225 Difference]: With dead ends: 2079 [2024-11-13 14:59:14,713 INFO L226 Difference]: Without dead ends: 1131 [2024-11-13 14:59:14,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:59:14,716 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 343 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:14,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 909 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:59:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-13 14:59:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 951. [2024-11-13 14:59:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 831 states have (on average 1.2948255114320095) internal successors, (1076), 837 states have internal predecessors, (1076), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1280 transitions. [2024-11-13 14:59:14,868 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1280 transitions. Word has length 122 [2024-11-13 14:59:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:14,870 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1280 transitions. [2024-11-13 14:59:14,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1280 transitions. [2024-11-13 14:59:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 14:59:14,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:14,875 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:14,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 14:59:14,876 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:14,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1313549394, now seen corresponding path program 1 times [2024-11-13 14:59:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:14,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868835687] [2024-11-13 14:59:14,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:15,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868835687] [2024-11-13 14:59:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868835687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:59:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546828169] [2024-11-13 14:59:15,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:15,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:59:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:15,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:59:15,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:59:15,790 INFO L87 Difference]: Start difference. First operand 951 states and 1280 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:16,776 INFO L93 Difference]: Finished difference Result 2212 states and 2985 transitions. [2024-11-13 14:59:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:59:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 14:59:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:16,785 INFO L225 Difference]: With dead ends: 2212 [2024-11-13 14:59:16,786 INFO L226 Difference]: Without dead ends: 1264 [2024-11-13 14:59:16,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:59:16,789 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 329 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:16,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 2101 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:59:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2024-11-13 14:59:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 939. [2024-11-13 14:59:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 819 states have (on average 1.2954822954822955) internal successors, (1061), 825 states have internal predecessors, (1061), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1265 transitions. [2024-11-13 14:59:16,957 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1265 transitions. Word has length 122 [2024-11-13 14:59:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:16,958 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1265 transitions. [2024-11-13 14:59:16,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1265 transitions. [2024-11-13 14:59:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 14:59:16,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:16,961 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:16,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 14:59:16,961 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:16,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1088198513, now seen corresponding path program 1 times [2024-11-13 14:59:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175801864] [2024-11-13 14:59:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175801864] [2024-11-13 14:59:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175801864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:17,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:59:17,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769479714] [2024-11-13 14:59:17,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:59:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:59:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:59:17,937 INFO L87 Difference]: Start difference. First operand 939 states and 1265 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:18,795 INFO L93 Difference]: Finished difference Result 1577 states and 2135 transitions. [2024-11-13 14:59:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:59:18,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 14:59:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:18,806 INFO L225 Difference]: With dead ends: 1577 [2024-11-13 14:59:18,807 INFO L226 Difference]: Without dead ends: 950 [2024-11-13 14:59:18,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:59:18,810 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 176 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:18,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1261 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:59:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-13 14:59:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2024-11-13 14:59:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 828 states have (on average 1.2922705314009661) internal successors, (1070), 834 states have internal predecessors, (1070), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1274 transitions. [2024-11-13 14:59:19,046 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1274 transitions. Word has length 124 [2024-11-13 14:59:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:19,049 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1274 transitions. [2024-11-13 14:59:19,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1274 transitions. [2024-11-13 14:59:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 14:59:19,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:19,052 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:19,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 14:59:19,052 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:19,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:19,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1488628392, now seen corresponding path program 1 times [2024-11-13 14:59:19,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:19,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634002483] [2024-11-13 14:59:19,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:19,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:19,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634002483] [2024-11-13 14:59:19,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634002483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:19,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:19,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:59:19,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798760931] [2024-11-13 14:59:19,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:19,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:59:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:19,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:59:19,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:59:19,310 INFO L87 Difference]: Start difference. First operand 948 states and 1274 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:19,548 INFO L93 Difference]: Finished difference Result 1573 states and 2122 transitions. [2024-11-13 14:59:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:59:19,549 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 14:59:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:19,555 INFO L225 Difference]: With dead ends: 1573 [2024-11-13 14:59:19,556 INFO L226 Difference]: Without dead ends: 937 [2024-11-13 14:59:19,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:59:19,558 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 43 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:19,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 673 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:59:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-13 14:59:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 933. [2024-11-13 14:59:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 813 states have (on average 1.2865928659286592) internal successors, (1046), 819 states have internal predecessors, (1046), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1250 transitions. [2024-11-13 14:59:19,758 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1250 transitions. Word has length 124 [2024-11-13 14:59:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:19,759 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1250 transitions. [2024-11-13 14:59:19,759 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1250 transitions. [2024-11-13 14:59:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 14:59:19,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:19,761 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:19,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 14:59:19,761 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:19,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1436830296, now seen corresponding path program 1 times [2024-11-13 14:59:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624130911] [2024-11-13 14:59:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624130911] [2024-11-13 14:59:19,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624130911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:19,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:59:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759904628] [2024-11-13 14:59:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:19,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:59:19,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:59:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:59:19,993 INFO L87 Difference]: Start difference. First operand 933 states and 1250 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:20,180 INFO L93 Difference]: Finished difference Result 1893 states and 2537 transitions. [2024-11-13 14:59:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:59:20,181 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 14:59:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:20,186 INFO L225 Difference]: With dead ends: 1893 [2024-11-13 14:59:20,187 INFO L226 Difference]: Without dead ends: 963 [2024-11-13 14:59:20,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-13 14:59:20,190 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:20,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:59:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-13 14:59:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-13 14:59:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 843 states have (on average 1.276393831553974) internal successors, (1076), 849 states have internal predecessors, (1076), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1280 transitions. [2024-11-13 14:59:20,363 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1280 transitions. Word has length 124 [2024-11-13 14:59:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:20,364 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1280 transitions. [2024-11-13 14:59:20,364 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1280 transitions. [2024-11-13 14:59:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:59:20,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:20,370 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:20,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 14:59:20,370 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1484398419, now seen corresponding path program 1 times [2024-11-13 14:59:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597152669] [2024-11-13 14:59:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:20,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597152669] [2024-11-13 14:59:20,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597152669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:20,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:20,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:59:20,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926388250] [2024-11-13 14:59:20,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:20,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:59:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:20,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:59:20,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:59:20,664 INFO L87 Difference]: Start difference. First operand 963 states and 1280 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:20,934 INFO L93 Difference]: Finished difference Result 1900 states and 2523 transitions. [2024-11-13 14:59:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:59:20,935 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-13 14:59:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:20,941 INFO L225 Difference]: With dead ends: 1900 [2024-11-13 14:59:20,941 INFO L226 Difference]: Without dead ends: 940 [2024-11-13 14:59:20,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-13 14:59:20,944 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 35 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:20,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 565 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:59:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-13 14:59:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 936. [2024-11-13 14:59:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 816 states have (on average 1.2647058823529411) internal successors, (1032), 822 states have internal predecessors, (1032), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1236 transitions. [2024-11-13 14:59:21,108 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1236 transitions. Word has length 126 [2024-11-13 14:59:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:21,109 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1236 transitions. [2024-11-13 14:59:21,109 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1236 transitions. [2024-11-13 14:59:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:59:21,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:21,111 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:21,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 14:59:21,112 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1303793736, now seen corresponding path program 1 times [2024-11-13 14:59:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269122436] [2024-11-13 14:59:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:22,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:22,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269122436] [2024-11-13 14:59:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269122436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:22,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:59:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128854481] [2024-11-13 14:59:22,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:22,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:59:22,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:22,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:59:22,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:59:22,924 INFO L87 Difference]: Start difference. First operand 936 states and 1236 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:24,754 INFO L93 Difference]: Finished difference Result 1823 states and 2422 transitions. [2024-11-13 14:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:59:24,755 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 14:59:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:24,764 INFO L225 Difference]: With dead ends: 1823 [2024-11-13 14:59:24,764 INFO L226 Difference]: Without dead ends: 1193 [2024-11-13 14:59:24,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:59:24,770 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 219 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:24,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1727 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:59:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-13 14:59:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 993. [2024-11-13 14:59:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 873 states have (on average 1.258877434135166) internal successors, (1099), 879 states have internal predecessors, (1099), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1303 transitions. [2024-11-13 14:59:25,024 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1303 transitions. Word has length 128 [2024-11-13 14:59:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:25,025 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1303 transitions. [2024-11-13 14:59:25,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1303 transitions. [2024-11-13 14:59:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:59:25,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:25,027 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:25,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 14:59:25,027 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1983852106, now seen corresponding path program 1 times [2024-11-13 14:59:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:25,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587626357] [2024-11-13 14:59:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587626357] [2024-11-13 14:59:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587626357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:25,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:25,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:59:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190214058] [2024-11-13 14:59:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:25,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:59:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:59:25,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:59:25,431 INFO L87 Difference]: Start difference. First operand 993 states and 1303 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:25,915 INFO L93 Difference]: Finished difference Result 1792 states and 2370 transitions. [2024-11-13 14:59:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:59:25,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 14:59:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:25,923 INFO L225 Difference]: With dead ends: 1792 [2024-11-13 14:59:25,923 INFO L226 Difference]: Without dead ends: 1105 [2024-11-13 14:59:25,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:59:25,926 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 210 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:25,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 874 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:59:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-13 14:59:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 993. [2024-11-13 14:59:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 873 states have (on average 1.256586483390607) internal successors, (1097), 879 states have internal predecessors, (1097), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:59:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1301 transitions. [2024-11-13 14:59:26,123 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1301 transitions. Word has length 128 [2024-11-13 14:59:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:26,124 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1301 transitions. [2024-11-13 14:59:26,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1301 transitions. [2024-11-13 14:59:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:59:26,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:26,127 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:26,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 14:59:26,127 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:26,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1231407178, now seen corresponding path program 1 times [2024-11-13 14:59:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:26,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992675426] [2024-11-13 14:59:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992675426] [2024-11-13 14:59:26,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992675426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:26,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:26,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:59:26,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315285233] [2024-11-13 14:59:26,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:26,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:59:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:26,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:59:26,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:59:26,680 INFO L87 Difference]: Start difference. First operand 993 states and 1301 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:27,265 INFO L93 Difference]: Finished difference Result 1838 states and 2430 transitions. [2024-11-13 14:59:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:59:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 14:59:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:27,283 INFO L225 Difference]: With dead ends: 1838 [2024-11-13 14:59:27,283 INFO L226 Difference]: Without dead ends: 1151 [2024-11-13 14:59:27,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:59:27,288 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 212 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:27,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 904 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:59:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-13 14:59:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 838. [2024-11-13 14:59:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 738 states have (on average 1.2493224932249323) internal successors, (922), 742 states have internal predecessors, (922), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 14:59:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1090 transitions. [2024-11-13 14:59:27,465 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1090 transitions. Word has length 128 [2024-11-13 14:59:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:27,466 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1090 transitions. [2024-11-13 14:59:27,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1090 transitions. [2024-11-13 14:59:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:59:27,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:27,468 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:27,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 14:59:27,469 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:27,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1911465548, now seen corresponding path program 1 times [2024-11-13 14:59:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:27,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207460140] [2024-11-13 14:59:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207460140] [2024-11-13 14:59:29,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207460140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:29,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:29,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 14:59:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320674495] [2024-11-13 14:59:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:29,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:59:29,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:29,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:59:29,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:59:29,842 INFO L87 Difference]: Start difference. First operand 838 states and 1090 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:59:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:32,256 INFO L93 Difference]: Finished difference Result 1430 states and 1869 transitions. [2024-11-13 14:59:32,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:59:32,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2024-11-13 14:59:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:32,263 INFO L225 Difference]: With dead ends: 1430 [2024-11-13 14:59:32,263 INFO L226 Difference]: Without dead ends: 898 [2024-11-13 14:59:32,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:59:32,266 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 491 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:32,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1796 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:59:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-13 14:59:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 834. [2024-11-13 14:59:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 734 states have (on average 1.2493188010899183) internal successors, (917), 738 states have internal predecessors, (917), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 14:59:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1085 transitions. [2024-11-13 14:59:32,424 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1085 transitions. Word has length 128 [2024-11-13 14:59:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:32,424 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1085 transitions. [2024-11-13 14:59:32,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:59:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1085 transitions. [2024-11-13 14:59:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:59:32,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:32,426 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 14:59:32,427 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1278021759, now seen corresponding path program 1 times [2024-11-13 14:59:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070515035] [2024-11-13 14:59:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:59:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:59:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:59:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:59:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:59:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:59:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:59:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:59:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:59:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:59:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:59:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:59:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-13 14:59:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:33,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070515035] [2024-11-13 14:59:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070515035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:59:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167589067] [2024-11-13 14:59:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:33,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:59:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:33,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:59:33,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:59:33,469 INFO L87 Difference]: Start difference. First operand 834 states and 1085 transitions. Second operand has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:59:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:35,296 INFO L93 Difference]: Finished difference Result 1798 states and 2330 transitions. [2024-11-13 14:59:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 14:59:35,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2024-11-13 14:59:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:35,303 INFO L225 Difference]: With dead ends: 1798 [2024-11-13 14:59:35,303 INFO L226 Difference]: Without dead ends: 967 [2024-11-13 14:59:35,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2024-11-13 14:59:35,306 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 390 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:35,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1068 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:59:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-13 14:59:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 787. [2024-11-13 14:59:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 686 states have (on average 1.2565597667638484) internal successors, (862), 690 states have internal predecessors, (862), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 14:59:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1030 transitions. [2024-11-13 14:59:35,517 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1030 transitions. Word has length 128 [2024-11-13 14:59:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:35,517 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1030 transitions. [2024-11-13 14:59:35,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:59:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1030 transitions. [2024-11-13 14:59:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:59:35,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:35,522 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:35,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 14:59:35,522 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2088129157, now seen corresponding path program 1 times [2024-11-13 14:59:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:35,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735328251] [2024-11-13 14:59:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:59:35,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:59:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:59:35,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:59:35,855 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:59:35,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:59:35,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 14:59:35,862 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:59:36,073 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:59:36,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:59:36 BoogieIcfgContainer [2024-11-13 14:59:36,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:59:36,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:59:36,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:59:36,080 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:59:36,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:58:41" (3/4) ... [2024-11-13 14:59:36,084 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:59:36,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:59:36,087 INFO L158 Benchmark]: Toolchain (without parser) took 56906.05ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 92.2MB in the beginning and 47.7MB in the end (delta: 44.6MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2024-11-13 14:59:36,087 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 167.8MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:59:36,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.74ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 77.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:59:36,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.85ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 74.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:59:36,090 INFO L158 Benchmark]: Boogie Preprocessor took 79.16ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 70.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:59:36,090 INFO L158 Benchmark]: RCFGBuilder took 1240.24ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 87.0MB in the end (delta: -16.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-13 14:59:36,090 INFO L158 Benchmark]: TraceAbstraction took 54928.65ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 86.4MB in the beginning and 47.7MB in the end (delta: 38.7MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2024-11-13 14:59:36,090 INFO L158 Benchmark]: Witness Printer took 5.41ms. Allocated memory is still 167.8MB. Free memory was 47.7MB in the beginning and 47.7MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:59:36,091 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.12ms. Allocated memory is still 167.8MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.74ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 77.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.85ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 74.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.16ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 70.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1240.24ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 87.0MB in the end (delta: -16.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * TraceAbstraction took 54928.65ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 86.4MB in the beginning and 47.7MB in the end (delta: 38.7MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * Witness Printer took 5.41ms. Allocated memory is still 167.8MB. Free memory was 47.7MB in the beginning and 47.7MB in the end (delta: 21.5kB). 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 106, overapproximation of someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L30] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L33] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[3]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar4_Pointer = &(double_Array_0[4]); [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L40-L42] signed long int signed_long_int_Array_0[1] = { -10 }; [L40-L42] signed long int signed_long_int_Array_0[1] = { -10 }; [L43] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L47] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L48] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer = &(unsigned_long_int_Array_0[1]); [L49] signed long int last_1_signed_long_int_Array_0_0_ = -10; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=0, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] EXPR signed_long_int_Array_0[0] [L103] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L81] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L84] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L87] double_Array_0[0] = __VERIFIER_nondet_double() [L88] EXPR double_Array_0[0] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L88] EXPR double_Array_0[0] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L89] double_Array_0[1] = __VERIFIER_nondet_double() [L90] EXPR double_Array_0[1] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L90] EXPR double_Array_0[1] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR (double_Array_0[1] >= 0.0F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR (double_Array_0[1] >= 0.0F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L91] double_Array_0[3] = __VERIFIER_nondet_double() [L92] EXPR double_Array_0[3] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L92] EXPR double_Array_0[3] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L93] double_Array_0[4] = __VERIFIER_nondet_double() [L94] EXPR double_Array_0[4] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L94] EXPR double_Array_0[4] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L95] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L96] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L96] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L96] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L98] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L99] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L114] RET updateVariables() [L115] CALL step() [L53] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L53] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L56] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L56] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L56] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L56] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) = ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))) [L58] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L58] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L61] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L61] unsigned char stepLocal_1 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)); [L62] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L62] signed long int stepLocal_0 = (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)); [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L63] COND TRUE stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L64] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L64] COND FALSE !(stepLocal_0 < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) [L69] (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) = 2 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L74] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L74] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L74] COND TRUE (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L75] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L75] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L75] (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) = ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2)) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L106] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L106] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1 [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L106] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106-L107] return (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.6s, OverallIterations: 37, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6355 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6355 mSDsluCounter, 33270 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26326 mSDsCounter, 650 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6848 IncrementalHoareTripleChecker+Invalid, 7498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 650 mSolverCounterUnsat, 6944 mSDtfsCounter, 6848 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1256 GetRequests, 959 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=993occurred in iteration=32, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 3060 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 4476 NumberOfCodeBlocks, 4476 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4312 ConstructedInterpolants, 0 QuantifiedInterpolants, 23428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 9504/9504 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:59:36,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/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_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd --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 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:59:38,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:59:39,098 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:59:39,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:59:39,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:59:39,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:59:39,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:59:39,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:59:39,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:59:39,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:59:39,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:59:39,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:59:39,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:59:39,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:59:39,157 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:59:39,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:59:39,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:59:39,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:59:39,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:59:39,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:59:39,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:59:39,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:59:39,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:59:39,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:59:39,159 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:59:39,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:59:39,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:59:39,159 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:59:39,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:59:39,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:59:39,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:59:39,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:59:39,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:59:39,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:59:39,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:59:39,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:59:39,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:59:39,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:59:39,160 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:59:39,161 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:59:39,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:59:39,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:59:39,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:59:39,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:59:39,161 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_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd 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 -> 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 [2024-11-13 14:59:39,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:59:39,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:59:39,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:59:39,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:59:39,674 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:59:39,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i Unable to find full path for "g++" [2024-11-13 14:59:41,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:59:42,096 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:59:42,097 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-13 14:59:42,112 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/data/9c6fd7ca6/004de41701df48bea60d917a1e7ce417/FLAGaf0d67da1 [2024-11-13 14:59:42,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/data/9c6fd7ca6/004de41701df48bea60d917a1e7ce417 [2024-11-13 14:59:42,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:59:42,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:59:42,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:59:42,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:59:42,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:59:42,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3b47fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42, skipping insertion in model container [2024-11-13 14:59:42,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:59:42,432 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_0ffd586e-bafb-48c4-be44-1ad59e6e0945/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-11-13 14:59:42,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:59:42,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:59:42,624 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_0ffd586e-bafb-48c4-be44-1ad59e6e0945/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-11-13 14:59:42,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:59:42,741 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:59:42,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42 WrapperNode [2024-11-13 14:59:42,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:59:42,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:59:42,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:59:42,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:59:42,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,856 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 511 [2024-11-13 14:59:42,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:59:42,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:59:42,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:59:42,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:59:42,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,953 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-11-13 14:59:42,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:42,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:43,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:43,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:43,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:43,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:59:43,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:59:43,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:59:43,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:59:43,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (1/1) ... [2024-11-13 14:59:43,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:59:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:59:43,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:59:43,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 14:59:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-13 14:59:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-13 14:59:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-13 14:59:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-13 14:59:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:59:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:59:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 14:59:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 14:59:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 14:59:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-13 14:59:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:59:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:59:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:59:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 14:59:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 14:59:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 14:59:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:59:43,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:59:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:59:43,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:59:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 14:59:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 14:59:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 14:59:43,454 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:59:43,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:59:46,486 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-11-13 14:59:46,487 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:59:46,503 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:59:46,504 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:59:46,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:59:46 BoogieIcfgContainer [2024-11-13 14:59:46,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:59:46,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:59:46,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:59:46,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:59:46,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:59:42" (1/3) ... [2024-11-13 14:59:46,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b3eb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:59:46, skipping insertion in model container [2024-11-13 14:59:46,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:59:42" (2/3) ... [2024-11-13 14:59:46,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b3eb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:59:46, skipping insertion in model container [2024-11-13 14:59:46,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:59:46" (3/3) ... [2024-11-13 14:59:46,518 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-13 14:59:46,536 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:59:46,538 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-15.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:59:46,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:59:46,656 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;@17a51bdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:59:46,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:59:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:59:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:59:46,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:46,691 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:46,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash 357738169, now seen corresponding path program 1 times [2024-11-13 14:59:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:59:46,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074708936] [2024-11-13 14:59:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:46,721 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-13 14:59:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:59:46,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:46,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:47,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:59:47,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:59:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 14:59:47,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:59:47,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:59:47,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074708936] [2024-11-13 14:59:47,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074708936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:47,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:47,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:59:47,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174204398] [2024-11-13 14:59:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:47,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:59:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:59:47,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:59:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:59:47,436 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:59:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:47,469 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-13 14:59:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:59:47,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-13 14:59:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:47,479 INFO L225 Difference]: With dead ends: 219 [2024-11-13 14:59:47,479 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 14:59:47,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-13 14:59:47,486 INFO L432 NwaCegarLoop]: 157 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, 157 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-13 14:59:47,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:59:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 14:59:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 14:59:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:59:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-13 14:59:47,536 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-13 14:59:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:47,537 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-13 14:59:47,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:59:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-13 14:59:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:59:47,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:47,541 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:47,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:47,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:47,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:47,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1502558233, now seen corresponding path program 1 times [2024-11-13 14:59:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:59:47,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450415694] [2024-11-13 14:59:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:47,745 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-13 14:59:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:59:47,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:47,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:48,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:59:48,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:59:49,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 14:59:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 14:59:49,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:59:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:49,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:59:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450415694] [2024-11-13 14:59:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450415694] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:59:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:59:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-13 14:59:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952626873] [2024-11-13 14:59:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:49,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:59:49,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:59:49,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:59:49,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:59:49,982 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:50,240 INFO L93 Difference]: Finished difference Result 267 states and 386 transitions. [2024-11-13 14:59:50,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:59:50,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:59:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:50,244 INFO L225 Difference]: With dead ends: 267 [2024-11-13 14:59:50,244 INFO L226 Difference]: Without dead ends: 161 [2024-11-13 14:59:50,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:59:50,246 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 150 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:50,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 561 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:59:50,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-13 14:59:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 111. [2024-11-13 14:59:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:59:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-13 14:59:50,263 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-13 14:59:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:50,265 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-13 14:59:50,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-13 14:59:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:59:50,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:50,269 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:50,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:50,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:50,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:50,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:50,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1007688176, now seen corresponding path program 1 times [2024-11-13 14:59:50,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:59:50,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16361016] [2024-11-13 14:59:50,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:50,475 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-13 14:59:50,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:59:50,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:50,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:51,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:59:51,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:59:53,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 14:59:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:59:53,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:59:54,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:59:54,266 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 16 treesize of output 19 [2024-11-13 14:59:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 14:59:55,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:59:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16361016] [2024-11-13 14:59:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16361016] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:59:55,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:59:55,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2024-11-13 14:59:55,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155909118] [2024-11-13 14:59:55,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:55,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:59:55,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:59:55,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:59:55,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:59:55,433 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:59:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:57,134 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2024-11-13 14:59:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:59:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-13 14:59:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:57,140 INFO L225 Difference]: With dead ends: 379 [2024-11-13 14:59:57,140 INFO L226 Difference]: Without dead ends: 271 [2024-11-13 14:59:57,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:59:57,143 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 321 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:57,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 685 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:59:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-13 14:59:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 211. [2024-11-13 14:59:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 184 states have internal predecessors, (258), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:59:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 306 transitions. [2024-11-13 14:59:57,187 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 306 transitions. Word has length 115 [2024-11-13 14:59:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:57,188 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 306 transitions. [2024-11-13 14:59:57,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:59:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 306 transitions. [2024-11-13 14:59:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:59:57,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:57,191 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:57,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:57,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:57,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:57,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -873674670, now seen corresponding path program 1 times [2024-11-13 14:59:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:59:57,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916375898] [2024-11-13 14:59:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:57,399 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-13 14:59:57,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:59:57,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:57,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 14:59:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:57,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:59:57,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:59:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 14:59:58,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:59:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:59:59,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:59:59,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916375898] [2024-11-13 14:59:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916375898] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:59:59,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:59:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 14:59:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213273276] [2024-11-13 14:59:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:59,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:59:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:59:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:59:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:59:59,215 INFO L87 Difference]: Start difference. First operand 211 states and 306 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:59,446 INFO L93 Difference]: Finished difference Result 471 states and 683 transitions. [2024-11-13 14:59:59,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:59:59,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:59:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:59,454 INFO L225 Difference]: With dead ends: 471 [2024-11-13 14:59:59,454 INFO L226 Difference]: Without dead ends: 263 [2024-11-13 14:59:59,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:59:59,460 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 72 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:59,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 578 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:59:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-13 14:59:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 215. [2024-11-13 14:59:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 188 states have (on average 1.3936170212765957) internal successors, (262), 188 states have internal predecessors, (262), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:59:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 310 transitions. [2024-11-13 14:59:59,509 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 310 transitions. Word has length 115 [2024-11-13 14:59:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:59,510 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 310 transitions. [2024-11-13 14:59:59,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:59:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 310 transitions. [2024-11-13 14:59:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:59:59,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:59,513 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:59:59,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 14:59:59,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:59,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:59,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1732348884, now seen corresponding path program 1 times [2024-11-13 14:59:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:59:59,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471535415] [2024-11-13 14:59:59,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:59,718 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-13 14:59:59,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:59:59,725 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 14:59:59,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:00,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:00:00,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:00,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:00,872 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:00,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471535415] [2024-11-13 15:00:00,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471535415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:00,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:00,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:00:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544868548] [2024-11-13 15:00:00,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:00,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:00:00,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:00,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:00:00,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:00:00,877 INFO L87 Difference]: Start difference. First operand 215 states and 310 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:01,028 INFO L93 Difference]: Finished difference Result 438 states and 630 transitions. [2024-11-13 15:00:01,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:01,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 15:00:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:01,032 INFO L225 Difference]: With dead ends: 438 [2024-11-13 15:00:01,032 INFO L226 Difference]: Without dead ends: 226 [2024-11-13 15:00:01,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:01,036 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 90 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:01,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 440 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:00:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-13 15:00:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2024-11-13 15:00:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 189 states have (on average 1.3862433862433863) internal successors, (262), 189 states have internal predecessors, (262), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 15:00:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 310 transitions. [2024-11-13 15:00:01,058 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 310 transitions. Word has length 115 [2024-11-13 15:00:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:01,059 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 310 transitions. [2024-11-13 15:00:01,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 310 transitions. [2024-11-13 15:00:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:00:01,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:01,062 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:01,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-13 15:00:01,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:01,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:01,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash -262343157, now seen corresponding path program 1 times [2024-11-13 15:00:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487405721] [2024-11-13 15:00:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:01,264 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-13 15:00:01,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:01,266 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:01,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:01,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:00:01,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:01,676 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-13 15:00:01,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:00:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:01,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:01,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487405721] [2024-11-13 15:00:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487405721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:00:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815690336] [2024-11-13 15:00:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:01,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:00:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:00:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:00:01,746 INFO L87 Difference]: Start difference. First operand 216 states and 310 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:01,994 INFO L93 Difference]: Finished difference Result 589 states and 848 transitions. [2024-11-13 15:00:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:00:01,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 15:00:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:02,002 INFO L225 Difference]: With dead ends: 589 [2024-11-13 15:00:02,002 INFO L226 Difference]: Without dead ends: 376 [2024-11-13 15:00:02,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:02,006 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 114 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:02,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 553 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-13 15:00:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2024-11-13 15:00:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 327 states have (on average 1.3944954128440368) internal successors, (456), 329 states have internal predecessors, (456), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:00:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 536 transitions. [2024-11-13 15:00:02,067 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 536 transitions. Word has length 116 [2024-11-13 15:00:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:02,068 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 536 transitions. [2024-11-13 15:00:02,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 536 transitions. [2024-11-13 15:00:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:00:02,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:02,071 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:02,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-13 15:00:02,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:02,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:02,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash -390506924, now seen corresponding path program 1 times [2024-11-13 15:00:02,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:02,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202459079] [2024-11-13 15:00:02,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:02,274 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-13 15:00:02,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:02,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:02,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:02,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:00:02,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:00:04,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:04,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202459079] [2024-11-13 15:00:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202459079] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:00:04,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:00:04,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 15:00:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182902401] [2024-11-13 15:00:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:04,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:00:04,459 INFO L87 Difference]: Start difference. First operand 372 states and 536 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:04,697 INFO L93 Difference]: Finished difference Result 828 states and 1192 transitions. [2024-11-13 15:00:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:04,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 15:00:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:04,704 INFO L225 Difference]: With dead ends: 828 [2024-11-13 15:00:04,704 INFO L226 Difference]: Without dead ends: 459 [2024-11-13 15:00:04,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:00:04,707 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 126 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:04,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 449 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-13 15:00:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 389. [2024-11-13 15:00:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 344 states have (on average 1.3895348837209303) internal successors, (478), 346 states have internal predecessors, (478), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:00:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 558 transitions. [2024-11-13 15:00:04,753 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 558 transitions. Word has length 116 [2024-11-13 15:00:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:04,755 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 558 transitions. [2024-11-13 15:00:04,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 558 transitions. [2024-11-13 15:00:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:00:04,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:04,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:04,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:04,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:04,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:04,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash -132341486, now seen corresponding path program 1 times [2024-11-13 15:00:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166686818] [2024-11-13 15:00:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:04,960 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-13 15:00:04,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:04,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:04,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:05,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:00:05,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:06,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:06,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166686818] [2024-11-13 15:00:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166686818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:00:06,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008805827] [2024-11-13 15:00:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:00:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:06,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:00:06,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:00:06,363 INFO L87 Difference]: Start difference. First operand 389 states and 558 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:06,535 INFO L93 Difference]: Finished difference Result 787 states and 1128 transitions. [2024-11-13 15:00:06,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:06,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 15:00:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:06,551 INFO L225 Difference]: With dead ends: 787 [2024-11-13 15:00:06,552 INFO L226 Difference]: Without dead ends: 401 [2024-11-13 15:00:06,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:06,555 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 80 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:06,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 524 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:00:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-13 15:00:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 391. [2024-11-13 15:00:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 346 states have (on average 1.3815028901734103) internal successors, (478), 348 states have internal predecessors, (478), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:00:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 558 transitions. [2024-11-13 15:00:06,593 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 558 transitions. Word has length 116 [2024-11-13 15:00:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:06,594 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 558 transitions. [2024-11-13 15:00:06,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 558 transitions. [2024-11-13 15:00:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 15:00:06,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:06,597 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:06,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-13 15:00:06,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:06,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:06,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash -39686846, now seen corresponding path program 1 times [2024-11-13 15:00:06,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:06,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912715515] [2024-11-13 15:00:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:06,800 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-13 15:00:06,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:06,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:06,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:07,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:00:07,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:00:08,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:08,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:08,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912715515] [2024-11-13 15:00:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912715515] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:00:08,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:00:08,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-13 15:00:08,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582844157] [2024-11-13 15:00:08,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:08,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:08,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:00:08,695 INFO L87 Difference]: Start difference. First operand 391 states and 558 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:08,922 INFO L93 Difference]: Finished difference Result 670 states and 954 transitions. [2024-11-13 15:00:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:08,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-13 15:00:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:08,928 INFO L225 Difference]: With dead ends: 670 [2024-11-13 15:00:08,929 INFO L226 Difference]: Without dead ends: 460 [2024-11-13 15:00:08,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:00:08,932 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 70 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:08,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 682 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-13 15:00:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 390. [2024-11-13 15:00:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 345 states have (on average 1.3768115942028984) internal successors, (475), 347 states have internal predecessors, (475), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:00:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 555 transitions. [2024-11-13 15:00:08,971 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 555 transitions. Word has length 117 [2024-11-13 15:00:08,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:08,971 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 555 transitions. [2024-11-13 15:00:08,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 555 transitions. [2024-11-13 15:00:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 15:00:08,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:08,974 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:08,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-13 15:00:09,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:09,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:09,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1272971539, now seen corresponding path program 1 times [2024-11-13 15:00:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:09,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767374205] [2024-11-13 15:00:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:09,180 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-13 15:00:09,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:09,183 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:09,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:09,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:00:09,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:00:10,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:10,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:10,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767374205] [2024-11-13 15:00:10,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767374205] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:00:10,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:00:10,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 15:00:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26535664] [2024-11-13 15:00:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:10,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:10,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:10,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:00:10,709 INFO L87 Difference]: Start difference. First operand 390 states and 555 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:10,941 INFO L93 Difference]: Finished difference Result 667 states and 947 transitions. [2024-11-13 15:00:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:10,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-13 15:00:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:10,945 INFO L225 Difference]: With dead ends: 667 [2024-11-13 15:00:10,946 INFO L226 Difference]: Without dead ends: 458 [2024-11-13 15:00:10,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:00:10,947 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 69 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:10,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 645 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-13 15:00:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 388. [2024-11-13 15:00:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 343 states have (on average 1.370262390670554) internal successors, (470), 345 states have internal predecessors, (470), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:00:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 550 transitions. [2024-11-13 15:00:10,982 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 550 transitions. Word has length 117 [2024-11-13 15:00:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:10,983 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 550 transitions. [2024-11-13 15:00:10,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 550 transitions. [2024-11-13 15:00:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 15:00:10,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:10,987 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:10,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:11,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:11,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:11,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2121387100, now seen corresponding path program 1 times [2024-11-13 15:00:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:11,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236529990] [2024-11-13 15:00:11,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:11,190 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-13 15:00:11,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:11,195 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:11,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-13 15:00:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:11,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:00:11,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:00:12,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:13,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:13,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236529990] [2024-11-13 15:00:13,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236529990] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:00:13,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:00:13,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-13 15:00:13,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804079943] [2024-11-13 15:00:13,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:13,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:00:13,219 INFO L87 Difference]: Start difference. First operand 388 states and 550 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:13,407 INFO L93 Difference]: Finished difference Result 663 states and 937 transitions. [2024-11-13 15:00:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:13,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 15:00:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:13,411 INFO L225 Difference]: With dead ends: 663 [2024-11-13 15:00:13,411 INFO L226 Difference]: Without dead ends: 456 [2024-11-13 15:00:13,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:00:13,413 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 119 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:13,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 536 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:00:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-13 15:00:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 388. [2024-11-13 15:00:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 343 states have (on average 1.3644314868804666) internal successors, (468), 345 states have internal predecessors, (468), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:00:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 548 transitions. [2024-11-13 15:00:13,441 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 548 transitions. Word has length 118 [2024-11-13 15:00:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:13,442 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 548 transitions. [2024-11-13 15:00:13,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 548 transitions. [2024-11-13 15:00:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 15:00:13,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:13,444 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:13,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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)] Ended with exit code 0 [2024-11-13 15:00:13,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:13,645 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2046985604, now seen corresponding path program 1 times [2024-11-13 15:00:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520509164] [2024-11-13 15:00:13,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:13,647 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-13 15:00:13,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:13,650 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:13,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:14,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:00:14,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:14,331 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-13 15:00:14,403 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 37 treesize of output 25 [2024-11-13 15:00:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:14,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:14,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:14,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520509164] [2024-11-13 15:00:14,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520509164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:14,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:00:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239572092] [2024-11-13 15:00:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:14,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:14,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:14,484 INFO L87 Difference]: Start difference. First operand 388 states and 548 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:14,856 INFO L93 Difference]: Finished difference Result 783 states and 1104 transitions. [2024-11-13 15:00:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:00:14,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 15:00:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:14,860 INFO L225 Difference]: With dead ends: 783 [2024-11-13 15:00:14,860 INFO L226 Difference]: Without dead ends: 398 [2024-11-13 15:00:14,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:00:14,862 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 110 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:14,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1058 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:00:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-13 15:00:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 394. [2024-11-13 15:00:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 349 states have (on average 1.3581661891117478) internal successors, (474), 351 states have internal predecessors, (474), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:00:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 554 transitions. [2024-11-13 15:00:14,890 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 554 transitions. Word has length 118 [2024-11-13 15:00:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:14,890 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 554 transitions. [2024-11-13 15:00:14,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 554 transitions. [2024-11-13 15:00:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 15:00:14,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:14,893 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:14,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:15,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:15,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:15,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 972487439, now seen corresponding path program 1 times [2024-11-13 15:00:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610477448] [2024-11-13 15:00:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:15,095 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-13 15:00:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:15,097 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:15,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-13 15:00:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:15,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:00:15,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:16,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-13 15:00:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:16,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:16,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610477448] [2024-11-13 15:00:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610477448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:16,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:16,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:00:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487920383] [2024-11-13 15:00:16,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:16,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:00:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:16,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:00:16,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:00:16,709 INFO L87 Difference]: Start difference. First operand 394 states and 554 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:17,885 INFO L93 Difference]: Finished difference Result 762 states and 1066 transitions. [2024-11-13 15:00:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:17,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 15:00:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:17,889 INFO L225 Difference]: With dead ends: 762 [2024-11-13 15:00:17,889 INFO L226 Difference]: Without dead ends: 371 [2024-11-13 15:00:17,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:00:17,892 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 308 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:17,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1137 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:00:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-13 15:00:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2024-11-13 15:00:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 314 states have (on average 1.3407643312101911) internal successors, (421), 316 states have internal predecessors, (421), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:00:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 505 transitions. [2024-11-13 15:00:17,928 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 505 transitions. Word has length 119 [2024-11-13 15:00:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:17,928 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 505 transitions. [2024-11-13 15:00:17,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 505 transitions. [2024-11-13 15:00:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 15:00:17,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:17,931 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:17,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-13 15:00:18,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:18,131 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:18,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1914050519, now seen corresponding path program 1 times [2024-11-13 15:00:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:18,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512143826] [2024-11-13 15:00:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:18,133 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-13 15:00:18,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:18,137 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:18,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-13 15:00:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:18,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:00:18,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:19,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-13 15:00:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:20,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:20,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:20,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512143826] [2024-11-13 15:00:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512143826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:20,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:00:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535906056] [2024-11-13 15:00:20,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:20,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:00:20,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:20,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:00:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:00:20,229 INFO L87 Difference]: Start difference. First operand 362 states and 505 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:21,298 INFO L93 Difference]: Finished difference Result 684 states and 946 transitions. [2024-11-13 15:00:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:00:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-13 15:00:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:21,301 INFO L225 Difference]: With dead ends: 684 [2024-11-13 15:00:21,302 INFO L226 Difference]: Without dead ends: 366 [2024-11-13 15:00:21,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:00:21,305 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 282 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:21,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1039 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:00:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-13 15:00:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 357. [2024-11-13 15:00:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 309 states have (on average 1.3365695792880259) internal successors, (413), 311 states have internal predecessors, (413), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:00:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 497 transitions. [2024-11-13 15:00:21,340 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 497 transitions. Word has length 120 [2024-11-13 15:00:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:21,341 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 497 transitions. [2024-11-13 15:00:21,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 497 transitions. [2024-11-13 15:00:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 15:00:21,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:21,343 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:21,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-13 15:00:21,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:21,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:21,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:21,545 INFO L85 PathProgramCache]: Analyzing trace with hash -305466369, now seen corresponding path program 1 times [2024-11-13 15:00:21,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903941781] [2024-11-13 15:00:21,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:21,546 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-13 15:00:21,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:21,549 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:21,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-13 15:00:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:21,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:00:21,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:22,108 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-13 15:00:22,108 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 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-13 15:00:22,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-13 15:00:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:22,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:22,293 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:22,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903941781] [2024-11-13 15:00:22,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903941781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:22,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:00:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032766620] [2024-11-13 15:00:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:22,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:22,296 INFO L87 Difference]: Start difference. First operand 357 states and 497 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:23,288 INFO L93 Difference]: Finished difference Result 741 states and 1034 transitions. [2024-11-13 15:00:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:23,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 15:00:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:23,293 INFO L225 Difference]: With dead ends: 741 [2024-11-13 15:00:23,294 INFO L226 Difference]: Without dead ends: 531 [2024-11-13 15:00:23,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:00:23,296 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 327 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:23,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 914 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:00:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-13 15:00:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2024-11-13 15:00:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 330 states have (on average 1.3333333333333333) internal successors, (440), 332 states have internal predecessors, (440), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:00:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 524 transitions. [2024-11-13 15:00:23,342 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 524 transitions. Word has length 121 [2024-11-13 15:00:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:23,342 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 524 transitions. [2024-11-13 15:00:23,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 524 transitions. [2024-11-13 15:00:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 15:00:23,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:23,344 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:23,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-13 15:00:23,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:23,546 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:23,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1083205128, now seen corresponding path program 1 times [2024-11-13 15:00:23,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:23,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221626158] [2024-11-13 15:00:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:23,547 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-13 15:00:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:23,550 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:23,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-13 15:00:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:24,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:00:24,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:24,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:00:24,555 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 155 treesize of output 65 [2024-11-13 15:00:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 15:00:24,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:24,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:24,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221626158] [2024-11-13 15:00:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221626158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:24,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:24,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:00:24,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584895344] [2024-11-13 15:00:24,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:24,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:24,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:24,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:24,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:24,612 INFO L87 Difference]: Start difference. First operand 379 states and 524 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:00:27,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:00:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:29,128 INFO L93 Difference]: Finished difference Result 744 states and 1027 transitions. [2024-11-13 15:00:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:29,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-13 15:00:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:29,137 INFO L225 Difference]: With dead ends: 744 [2024-11-13 15:00:29,138 INFO L226 Difference]: Without dead ends: 383 [2024-11-13 15:00:29,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:00:29,140 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 137 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:29,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 487 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-13 15:00:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-13 15:00:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2024-11-13 15:00:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 330 states have (on average 1.3212121212121213) internal successors, (436), 332 states have internal predecessors, (436), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:00:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2024-11-13 15:00:29,195 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 121 [2024-11-13 15:00:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:29,196 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2024-11-13 15:00:29,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:00:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2024-11-13 15:00:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 15:00:29,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:29,198 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:29,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-13 15:00:29,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:29,398 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:29,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1514584094, now seen corresponding path program 1 times [2024-11-13 15:00:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:29,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940496067] [2024-11-13 15:00:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:29,400 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-13 15:00:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:29,403 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:29,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-13 15:00:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:30,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:00:30,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:30,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:00:30,460 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 173 treesize of output 65 [2024-11-13 15:00:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:00:30,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:30,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:30,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940496067] [2024-11-13 15:00:30,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940496067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:30,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:30,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:00:30,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226453698] [2024-11-13 15:00:30,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:30,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:30,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:30,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:30,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:30,532 INFO L87 Difference]: Start difference. First operand 379 states and 520 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:00:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:34,361 INFO L93 Difference]: Finished difference Result 737 states and 1009 transitions. [2024-11-13 15:00:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2024-11-13 15:00:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:34,372 INFO L225 Difference]: With dead ends: 737 [2024-11-13 15:00:34,372 INFO L226 Difference]: Without dead ends: 383 [2024-11-13 15:00:34,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:00:34,374 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 127 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:34,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 483 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-13 15:00:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-13 15:00:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2024-11-13 15:00:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 330 states have (on average 1.309090909090909) internal successors, (432), 332 states have internal predecessors, (432), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:00:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 516 transitions. [2024-11-13 15:00:34,427 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 516 transitions. Word has length 123 [2024-11-13 15:00:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:34,427 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 516 transitions. [2024-11-13 15:00:34,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:00:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 516 transitions. [2024-11-13 15:00:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 15:00:34,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:34,429 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:34,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-13 15:00:34,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:34,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:34,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash -63054520, now seen corresponding path program 1 times [2024-11-13 15:00:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:34,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789997048] [2024-11-13 15:00:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:34,637 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-13 15:00:34,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:34,640 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:34,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-13 15:00:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:35,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:00:35,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:35,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:00:35,805 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 173 treesize of output 65 [2024-11-13 15:00:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 15:00:35,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:35,860 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:35,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789997048] [2024-11-13 15:00:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789997048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:35,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:35,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:00:35,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542765876] [2024-11-13 15:00:35,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:35,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:35,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:35,862 INFO L87 Difference]: Start difference. First operand 379 states and 516 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:00:39,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:00:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:39,759 INFO L93 Difference]: Finished difference Result 730 states and 991 transitions. [2024-11-13 15:00:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2024-11-13 15:00:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:39,772 INFO L225 Difference]: With dead ends: 730 [2024-11-13 15:00:39,773 INFO L226 Difference]: Without dead ends: 383 [2024-11-13 15:00:39,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:00:39,774 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 119 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:39,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 479 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-13 15:00:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-13 15:00:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2024-11-13 15:00:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 330 states have (on average 1.2969696969696969) internal successors, (428), 332 states have internal predecessors, (428), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:00:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 512 transitions. [2024-11-13 15:00:39,819 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 512 transitions. Word has length 125 [2024-11-13 15:00:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:39,819 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 512 transitions. [2024-11-13 15:00:39,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:00:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 512 transitions. [2024-11-13 15:00:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 15:00:39,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:39,823 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:39,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-13 15:00:40,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:40,024 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:40,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:40,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1650312482, now seen corresponding path program 1 times [2024-11-13 15:00:40,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:40,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771908437] [2024-11-13 15:00:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:40,025 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-13 15:00:40,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:40,027 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:40,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-13 15:00:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:40,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:00:40,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:41,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:00:41,091 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 173 treesize of output 65 [2024-11-13 15:00:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:00:41,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:41,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:41,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771908437] [2024-11-13 15:00:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771908437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:41,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:41,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:00:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218689941] [2024-11-13 15:00:41,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:41,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:41,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:41,150 INFO L87 Difference]: Start difference. First operand 379 states and 512 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:00:47,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:00:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:47,555 INFO L93 Difference]: Finished difference Result 723 states and 973 transitions. [2024-11-13 15:00:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:47,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2024-11-13 15:00:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:47,562 INFO L225 Difference]: With dead ends: 723 [2024-11-13 15:00:47,562 INFO L226 Difference]: Without dead ends: 383 [2024-11-13 15:00:47,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:00:47,563 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 110 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:47,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 472 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-13 15:00:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-13 15:00:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2024-11-13 15:00:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 330 states have (on average 1.284848484848485) internal successors, (424), 332 states have internal predecessors, (424), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:00:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 508 transitions. [2024-11-13 15:00:47,598 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 508 transitions. Word has length 127 [2024-11-13 15:00:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:47,598 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 508 transitions. [2024-11-13 15:00:47,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:00:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 508 transitions. [2024-11-13 15:00:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 15:00:47,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:47,600 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:47,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-13 15:00:47,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:47,800 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 43879494, now seen corresponding path program 1 times [2024-11-13 15:00:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960311021] [2024-11-13 15:00:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:47,801 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-13 15:00:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:47,804 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:47,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-13 15:00:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:48,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:00:48,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-13 15:00:48,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:00:48,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960311021] [2024-11-13 15:00:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960311021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:48,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:48,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:00:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669237244] [2024-11-13 15:00:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:48,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:48,586 INFO L87 Difference]: Start difference. First operand 379 states and 508 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 15:00:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:49,006 INFO L93 Difference]: Finished difference Result 730 states and 977 transitions. [2024-11-13 15:00:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2024-11-13 15:00:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:49,010 INFO L225 Difference]: With dead ends: 730 [2024-11-13 15:00:49,011 INFO L226 Difference]: Without dead ends: 387 [2024-11-13 15:00:49,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:00:49,013 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:49,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 654 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:00:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-13 15:00:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 379. [2024-11-13 15:00:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 330 states have (on average 1.2727272727272727) internal successors, (420), 332 states have internal predecessors, (420), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:00:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 504 transitions. [2024-11-13 15:00:49,053 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 504 transitions. Word has length 129 [2024-11-13 15:00:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:49,053 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 504 transitions. [2024-11-13 15:00:49,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 15:00:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 504 transitions. [2024-11-13 15:00:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 15:00:49,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:49,055 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:49,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-13 15:00:49,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:49,256 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:49,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 98272392, now seen corresponding path program 1 times [2024-11-13 15:00:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601583086] [2024-11-13 15:00:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:49,258 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-13 15:00:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:49,260 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:49,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-13 15:00:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:50,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 15:00:50,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:55,845 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-13 15:00:55,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-13 15:00:56,309 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 29 treesize of output 17 [2024-11-13 15:00:56,707 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2024-11-13 15:00:56,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2024-11-13 15:00:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 143 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-13 15:00:57,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:00:58,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:58,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601583086] [2024-11-13 15:00:58,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601583086] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:00:58,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:00:58,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [24] total 29 [2024-11-13 15:00:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106662022] [2024-11-13 15:00:58,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:58,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:58,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2024-11-13 15:00:58,683 INFO L87 Difference]: Start difference. First operand 379 states and 504 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:59,317 INFO L93 Difference]: Finished difference Result 764 states and 1028 transitions. [2024-11-13 15:00:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:00:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-13 15:00:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:59,322 INFO L225 Difference]: With dead ends: 764 [2024-11-13 15:00:59,322 INFO L226 Difference]: Without dead ends: 536 [2024-11-13 15:00:59,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2024-11-13 15:00:59,324 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 125 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:59,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 876 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:00:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-13 15:00:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2024-11-13 15:00:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 464 states have (on average 1.2823275862068966) internal successors, (595), 468 states have internal predecessors, (595), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 15:00:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 715 transitions. [2024-11-13 15:00:59,367 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 715 transitions. Word has length 129 [2024-11-13 15:00:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:59,368 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 715 transitions. [2024-11-13 15:00:59,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:00:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 715 transitions. [2024-11-13 15:00:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 15:00:59,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:59,370 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:00:59,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-13 15:00:59,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:59,572 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:00:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 692115325, now seen corresponding path program 1 times [2024-11-13 15:00:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:00:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692338765] [2024-11-13 15:00:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:59,574 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-13 15:00:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:00:59,576 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:00:59,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-13 15:01:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:00,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 15:01:00,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:06,288 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-13 15:01:06,288 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 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-13 15:01:06,706 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 29 treesize of output 17 [2024-11-13 15:01:07,032 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2024-11-13 15:01:07,032 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 1 case distinctions, treesize of input 30 treesize of output 37 [2024-11-13 15:01:08,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2024-11-13 15:01:08,368 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 50 treesize of output 34 [2024-11-13 15:01:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 143 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-13 15:01:08,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:01:09,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:01:09,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692338765] [2024-11-13 15:01:09,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692338765] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:09,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:01:09,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [25] total 30 [2024-11-13 15:01:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467884866] [2024-11-13 15:01:09,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:09,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:01:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:01:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:01:09,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2024-11-13 15:01:09,622 INFO L87 Difference]: Start difference. First operand 533 states and 715 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:01:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:10,340 INFO L93 Difference]: Finished difference Result 927 states and 1245 transitions. [2024-11-13 15:01:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:01:10,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-13 15:01:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:10,348 INFO L225 Difference]: With dead ends: 927 [2024-11-13 15:01:10,351 INFO L226 Difference]: Without dead ends: 545 [2024-11-13 15:01:10,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-13 15:01:10,354 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 119 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:10,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 675 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:01:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-13 15:01:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 493. [2024-11-13 15:01:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 432 states have (on average 1.2824074074074074) internal successors, (554), 435 states have internal predecessors, (554), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:01:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 658 transitions. [2024-11-13 15:01:10,395 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 658 transitions. Word has length 130 [2024-11-13 15:01:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:10,396 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 658 transitions. [2024-11-13 15:01:10,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:01:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 658 transitions. [2024-11-13 15:01:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 15:01:10,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:10,399 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:01:10,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-13 15:01:10,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:10,600 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:01:10,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1146040349, now seen corresponding path program 1 times [2024-11-13 15:01:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:01:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481300796] [2024-11-13 15:01:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:10,601 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-13 15:01:10,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:01:10,603 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:10,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-13 15:01:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:11,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:01:11,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:01:12,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:01:12,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:01:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481300796] [2024-11-13 15:01:12,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481300796] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:12,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:01:12,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 15:01:12,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663714530] [2024-11-13 15:01:12,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:12,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:01:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:01:12,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:01:12,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:01:12,648 INFO L87 Difference]: Start difference. First operand 493 states and 658 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:01:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:12,846 INFO L93 Difference]: Finished difference Result 1041 states and 1392 transitions. [2024-11-13 15:01:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:01:12,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-13 15:01:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:12,850 INFO L225 Difference]: With dead ends: 1041 [2024-11-13 15:01:12,850 INFO L226 Difference]: Without dead ends: 551 [2024-11-13 15:01:12,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:01:12,851 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 100 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:12,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 438 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:01:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-13 15:01:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 501. [2024-11-13 15:01:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 440 states have (on average 1.2772727272727273) internal successors, (562), 443 states have internal predecessors, (562), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:01:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 666 transitions. [2024-11-13 15:01:12,900 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 666 transitions. Word has length 130 [2024-11-13 15:01:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:12,901 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 666 transitions. [2024-11-13 15:01:12,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:01:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 666 transitions. [2024-11-13 15:01:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 15:01:12,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:12,902 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:01:12,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-13 15:01:13,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:13,104 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:01:13,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1546470228, now seen corresponding path program 1 times [2024-11-13 15:01:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:01:13,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733583844] [2024-11-13 15:01:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:13,105 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-13 15:01:13,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:01:13,108 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:13,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-13 15:01:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:14,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 15:01:14,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:18,200 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 23 treesize of output 11 [2024-11-13 15:01:18,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 15:01:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 15:01:18,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:19,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:01:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733583844] [2024-11-13 15:01:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733583844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647933020] [2024-11-13 15:01:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:19,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:19,110 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:19,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 15:01:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:19,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 15:01:19,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:23,499 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 27 treesize of output 11 [2024-11-13 15:01:23,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 15:01:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 15:01:23,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647933020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:24,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:01:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-13 15:01:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697119359] [2024-11-13 15:01:24,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:01:24,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 15:01:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:01:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 15:01:24,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-13 15:01:24,112 INFO L87 Difference]: Start difference. First operand 501 states and 666 transitions. Second operand has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 16 states have internal predecessors, (141), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 15:01:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:26,663 INFO L93 Difference]: Finished difference Result 1140 states and 1514 transitions. [2024-11-13 15:01:26,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:01:26,664 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 16 states have internal predecessors, (141), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 130 [2024-11-13 15:01:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:26,669 INFO L225 Difference]: With dead ends: 1140 [2024-11-13 15:01:26,669 INFO L226 Difference]: Without dead ends: 642 [2024-11-13 15:01:26,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 15:01:26,674 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 934 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:26,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1473 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 15:01:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-13 15:01:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 567. [2024-11-13 15:01:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 506 states have (on average 1.2766798418972332) internal successors, (646), 509 states have internal predecessors, (646), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:01:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 750 transitions. [2024-11-13 15:01:26,727 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 750 transitions. Word has length 130 [2024-11-13 15:01:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:26,728 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 750 transitions. [2024-11-13 15:01:26,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 16 states have internal predecessors, (141), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 15:01:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 750 transitions. [2024-11-13 15:01:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 15:01:26,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:26,730 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:01:26,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-13 15:01:26,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-13 15:01:27,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:27,131 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:01:27,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 845405650, now seen corresponding path program 1 times [2024-11-13 15:01:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:01:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321600226] [2024-11-13 15:01:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:27,132 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-13 15:01:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:01:27,134 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:27,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-13 15:01:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:27,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 15:01:27,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:28,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-13 15:01:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:01:28,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:01:28,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:01:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321600226] [2024-11-13 15:01:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321600226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:28,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:28,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:01:28,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546284618] [2024-11-13 15:01:28,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:01:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:01:28,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:01:28,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:01:28,689 INFO L87 Difference]: Start difference. First operand 567 states and 750 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:01:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:30,007 INFO L93 Difference]: Finished difference Result 1254 states and 1657 transitions. [2024-11-13 15:01:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:01:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-13 15:01:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:30,012 INFO L225 Difference]: With dead ends: 1254 [2024-11-13 15:01:30,013 INFO L226 Difference]: Without dead ends: 690 [2024-11-13 15:01:30,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:01:30,015 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 253 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:30,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1750 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:01:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-13 15:01:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 567. [2024-11-13 15:01:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 506 states have (on average 1.274703557312253) internal successors, (645), 509 states have internal predecessors, (645), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:01:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 749 transitions. [2024-11-13 15:01:30,067 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 749 transitions. Word has length 130 [2024-11-13 15:01:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:30,068 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 749 transitions. [2024-11-13 15:01:30,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:01:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 749 transitions. [2024-11-13 15:01:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:01:30,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:30,073 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:01:30,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-13 15:01:30,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:30,274 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:01:30,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2021706195, now seen corresponding path program 1 times [2024-11-13 15:01:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:01:30,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846504193] [2024-11-13 15:01:30,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:30,276 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-13 15:01:30,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:01:30,279 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:30,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-13 15:01:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:31,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 15:01:31,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:34,420 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-13 15:01:34,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-13 15:01:34,756 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 20 treesize of output 12 [2024-11-13 15:01:35,058 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2024-11-13 15:01:35,058 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 1 case distinctions, treesize of input 30 treesize of output 37 [2024-11-13 15:01:35,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-13 15:01:35,612 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 38 treesize of output 22 [2024-11-13 15:01:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-13 15:01:35,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:36,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-13 15:01:43,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:01:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846504193] [2024-11-13 15:01:43,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846504193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044781585] [2024-11-13 15:01:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:43,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:43,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:43,419 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:43,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-13 15:01:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:44,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 15:01:44,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:52,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:01:52,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-13 15:01:53,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:01:53,591 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 82 treesize of output 40 [2024-11-13 15:01:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 158 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-13 15:01:55,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:01:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044781585] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:01:57,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [19, 16] total 39 [2024-11-13 15:01:57,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448931700] [2024-11-13 15:01:57,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:57,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:01:57,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:01:57,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:01:57,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2024-11-13 15:01:57,261 INFO L87 Difference]: Start difference. First operand 567 states and 749 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:01:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:59,173 INFO L93 Difference]: Finished difference Result 1196 states and 1592 transitions. [2024-11-13 15:01:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:01:59,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 131 [2024-11-13 15:01:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:59,178 INFO L225 Difference]: With dead ends: 1196 [2024-11-13 15:01:59,179 INFO L226 Difference]: Without dead ends: 799 [2024-11-13 15:01:59,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=157, Invalid=2495, Unknown=0, NotChecked=0, Total=2652 [2024-11-13 15:01:59,182 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 108 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:59,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1333 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:01:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-13 15:01:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 632. [2024-11-13 15:01:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 570 states have (on average 1.2666666666666666) internal successors, (722), 573 states have internal predecessors, (722), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:01:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 826 transitions. [2024-11-13 15:01:59,234 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 826 transitions. Word has length 131 [2024-11-13 15:01:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:59,235 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 826 transitions. [2024-11-13 15:01:59,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:01:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 826 transitions. [2024-11-13 15:01:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:01:59,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:59,239 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:01:59,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-13 15:01:59,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-13 15:01:59,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:59,640 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:01:59,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash -581331038, now seen corresponding path program 1 times [2024-11-13 15:01:59,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:01:59,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190624598] [2024-11-13 15:01:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:59,642 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-13 15:01:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:01:59,645 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:01:59,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-13 15:02:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:00,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:02:00,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:00,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 15:02:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:02:00,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:02:00,288 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:02:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190624598] [2024-11-13 15:02:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190624598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:00,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:02:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600632253] [2024-11-13 15:02:00,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:00,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:02:00,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:02:00,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:02:00,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:02:00,290 INFO L87 Difference]: Start difference. First operand 632 states and 826 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:00,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:00,354 INFO L93 Difference]: Finished difference Result 1098 states and 1439 transitions. [2024-11-13 15:02:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:02:00,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 131 [2024-11-13 15:02:00,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:00,358 INFO L225 Difference]: With dead ends: 1098 [2024-11-13 15:02:00,358 INFO L226 Difference]: Without dead ends: 614 [2024-11-13 15:02:00,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:02:00,360 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:00,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:02:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-13 15:02:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2024-11-13 15:02:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 548 states have (on average 1.2445255474452555) internal successors, (682), 551 states have internal predecessors, (682), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:02:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 786 transitions. [2024-11-13 15:02:00,406 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 786 transitions. Word has length 131 [2024-11-13 15:02:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:00,407 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 786 transitions. [2024-11-13 15:02:00,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 786 transitions. [2024-11-13 15:02:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:02:00,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:00,408 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:02:00,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-13 15:02:00,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:00,610 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:00,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1802851477, now seen corresponding path program 1 times [2024-11-13 15:02:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:02:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082944661] [2024-11-13 15:02:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:00,612 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-13 15:02:00,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:02:00,614 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:00,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-13 15:02:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:01,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:02:01,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:01,540 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-13 15:02:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:02:01,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:02:01,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:02:01,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082944661] [2024-11-13 15:02:01,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082944661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:01,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:01,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:02:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584316564] [2024-11-13 15:02:01,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:01,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:02:01,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:02:01,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:02:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:02:01,584 INFO L87 Difference]: Start difference. First operand 610 states and 786 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:02,028 INFO L93 Difference]: Finished difference Result 1073 states and 1393 transitions. [2024-11-13 15:02:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:02:02,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 131 [2024-11-13 15:02:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:02,031 INFO L225 Difference]: With dead ends: 1073 [2024-11-13 15:02:02,032 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 15:02:02,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 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-13 15:02:02,034 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 48 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:02,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 687 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:02:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 15:02:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 592. [2024-11-13 15:02:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 530 states have (on average 1.2358490566037736) internal successors, (655), 533 states have internal predecessors, (655), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:02:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 759 transitions. [2024-11-13 15:02:02,082 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 759 transitions. Word has length 131 [2024-11-13 15:02:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:02,082 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 759 transitions. [2024-11-13 15:02:02,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 759 transitions. [2024-11-13 15:02:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:02:02,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:02,084 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:02:02,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-13 15:02:02,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:02,285 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:02,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2121340687, now seen corresponding path program 1 times [2024-11-13 15:02:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:02:02,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943813788] [2024-11-13 15:02:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:02,286 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-13 15:02:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:02:02,289 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:02,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-13 15:02:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:03,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 15:02:03,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:08,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 15:02:09,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:02:09,401 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 46 treesize of output 22 [2024-11-13 15:02:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-13 15:02:09,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:13,154 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 38 treesize of output 30 [2024-11-13 15:02:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-13 15:02:18,107 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:02:18,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943813788] [2024-11-13 15:02:18,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943813788] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:18,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:02:18,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19] total 34 [2024-11-13 15:02:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332001888] [2024-11-13 15:02:18,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:18,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:02:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:02:18,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:02:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 15:02:18,110 INFO L87 Difference]: Start difference. First operand 592 states and 759 transitions. Second operand has 18 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 15:02:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:23,208 INFO L93 Difference]: Finished difference Result 1101 states and 1422 transitions. [2024-11-13 15:02:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:02:23,210 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 132 [2024-11-13 15:02:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:23,213 INFO L225 Difference]: With dead ends: 1101 [2024-11-13 15:02:23,214 INFO L226 Difference]: Without dead ends: 682 [2024-11-13 15:02:23,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 190 SyntacticMatches, 41 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 15:02:23,216 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 690 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:23,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1709 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-13 15:02:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-13 15:02:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 607. [2024-11-13 15:02:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 545 states have (on average 1.2293577981651376) internal successors, (670), 548 states have internal predecessors, (670), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:02:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 774 transitions. [2024-11-13 15:02:23,260 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 774 transitions. Word has length 132 [2024-11-13 15:02:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 774 transitions. [2024-11-13 15:02:23,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 15:02:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 774 transitions. [2024-11-13 15:02:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:02:23,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:23,263 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:02:23,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2024-11-13 15:02:23,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:23,464 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:23,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1872991910, now seen corresponding path program 1 times [2024-11-13 15:02:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:02:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994714598] [2024-11-13 15:02:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:23,466 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-13 15:02:23,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:02:23,469 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:23,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-13 15:02:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:24,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:02:24,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:25,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 15:02:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:02:25,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:02:25,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:02:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994714598] [2024-11-13 15:02:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994714598] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:25,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:02:25,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-13 15:02:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170429799] [2024-11-13 15:02:25,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:25,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:02:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:02:25,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:02:25,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:02:25,791 INFO L87 Difference]: Start difference. First operand 607 states and 774 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:26,004 INFO L93 Difference]: Finished difference Result 1093 states and 1412 transitions. [2024-11-13 15:02:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:02:26,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 132 [2024-11-13 15:02:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:26,009 INFO L225 Difference]: With dead ends: 1093 [2024-11-13 15:02:26,010 INFO L226 Difference]: Without dead ends: 671 [2024-11-13 15:02:26,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:02:26,012 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 88 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:26,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 471 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:02:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-13 15:02:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 604. [2024-11-13 15:02:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 542 states have (on average 1.2195571955719557) internal successors, (661), 545 states have internal predecessors, (661), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:02:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 765 transitions. [2024-11-13 15:02:26,064 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 765 transitions. Word has length 132 [2024-11-13 15:02:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:26,064 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 765 transitions. [2024-11-13 15:02:26,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 765 transitions. [2024-11-13 15:02:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:02:26,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:26,066 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:02:26,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-11-13 15:02:26,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:26,267 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:26,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash 307790372, now seen corresponding path program 1 times [2024-11-13 15:02:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:02:26,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010734828] [2024-11-13 15:02:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:26,268 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-13 15:02:26,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:02:26,271 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:26,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-13 15:02:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:27,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:02:27,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:02:27,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:02:27,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:02:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010734828] [2024-11-13 15:02:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010734828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:27,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:02:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019063456] [2024-11-13 15:02:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:27,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:02:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:02:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:02:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:02:27,093 INFO L87 Difference]: Start difference. First operand 604 states and 765 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:27,182 INFO L93 Difference]: Finished difference Result 1220 states and 1547 transitions. [2024-11-13 15:02:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:02:27,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 132 [2024-11-13 15:02:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:27,194 INFO L225 Difference]: With dead ends: 1220 [2024-11-13 15:02:27,195 INFO L226 Difference]: Without dead ends: 619 [2024-11-13 15:02:27,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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-13 15:02:27,196 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:27,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:02:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-13 15:02:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2024-11-13 15:02:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 557 states have (on average 1.2136445242369838) internal successors, (676), 560 states have internal predecessors, (676), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:02:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 780 transitions. [2024-11-13 15:02:27,249 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 780 transitions. Word has length 132 [2024-11-13 15:02:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:27,250 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 780 transitions. [2024-11-13 15:02:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 780 transitions. [2024-11-13 15:02:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 15:02:27,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:27,252 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:02:27,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2024-11-13 15:02:27,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:27,453 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:27,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash 58818089, now seen corresponding path program 1 times [2024-11-13 15:02:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:02:27,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714500507] [2024-11-13 15:02:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:27,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:02:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:02:27,457 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:27,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-13 15:02:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:28,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:02:28,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 15:02:29,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:02:29,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:02:29,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714500507] [2024-11-13 15:02:29,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714500507] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:29,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:02:29,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 15:02:29,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619153088] [2024-11-13 15:02:29,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:29,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:02:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:02:29,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:02:29,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:02:29,669 INFO L87 Difference]: Start difference. First operand 619 states and 780 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:29,936 INFO L93 Difference]: Finished difference Result 1294 states and 1633 transitions. [2024-11-13 15:02:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:02:29,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 134 [2024-11-13 15:02:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:29,941 INFO L225 Difference]: With dead ends: 1294 [2024-11-13 15:02:29,941 INFO L226 Difference]: Without dead ends: 678 [2024-11-13 15:02:29,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:02:29,944 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 36 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:29,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 543 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:02:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-13 15:02:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 623. [2024-11-13 15:02:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 561 states have (on average 1.2085561497326203) internal successors, (678), 564 states have internal predecessors, (678), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:02:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 782 transitions. [2024-11-13 15:02:29,993 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 782 transitions. Word has length 134 [2024-11-13 15:02:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:29,994 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 782 transitions. [2024-11-13 15:02:29,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:02:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 782 transitions. [2024-11-13 15:02:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 15:02:29,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:29,996 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:02:30,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2024-11-13 15:02:30,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:30,200 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:30,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1642324424, now seen corresponding path program 1 times [2024-11-13 15:02:30,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:02:30,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470733365] [2024-11-13 15:02:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:30,202 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-13 15:02:30,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:02:30,205 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:02:30,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-13 15:02:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:31,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 15:02:31,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:33,361 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-13 15:02:33,945 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 24 treesize of output 20 [2024-11-13 15:02:34,106 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 24 [2024-11-13 15:02:34,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-13 15:02:34,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-13 15:02:34,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 15:02:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 15:02:34,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:02:36,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:02:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470733365] [2024-11-13 15:02:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470733365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:02:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850070688] [2024-11-13 15:02:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:36,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:36,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:36,529 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:36,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-13 15:02:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:37,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 15:02:37,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:02:50,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:02:50,896 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 14 [2024-11-13 15:02:52,520 INFO L349 Elim1Store]: treesize reduction 30, result has 33.3 percent of original size [2024-11-13 15:02:52,520 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 1 case distinctions, treesize of input 34 treesize of output 41 [2024-11-13 15:02:53,940 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 58 treesize of output 34 [2024-11-13 15:03:00,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:03:00,693 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 61 treesize of output 31 [2024-11-13 15:03:00,703 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 62 treesize of output 46 [2024-11-13 15:03:01,156 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 41 treesize of output 25 [2024-11-13 15:03:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 164 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-13 15:03:01,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:03:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850070688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:14,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:03:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 36] total 44 [2024-11-13 15:03:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500248053] [2024-11-13 15:03:14,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:03:14,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 15:03:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:03:14,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 15:03:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=4217, Unknown=0, NotChecked=0, Total=4692 [2024-11-13 15:03:14,527 INFO L87 Difference]: Start difference. First operand 623 states and 782 transitions. Second operand has 45 states, 42 states have (on average 4.023809523809524) internal successors, (169), 41 states have internal predecessors, (169), 7 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-13 15:03:52,168 WARN L286 SmtUtils]: Spent 16.31s on a formula simplification. DAG size of input: 76 DAG size of output: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:04:09,174 WARN L286 SmtUtils]: Spent 16.33s on a formula simplification. DAG size of input: 82 DAG size of output: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:04:26,630 WARN L286 SmtUtils]: Spent 16.33s on a formula simplification. DAG size of input: 81 DAG size of output: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:04:44,943 WARN L286 SmtUtils]: Spent 16.25s on a formula simplification. DAG size of input: 75 DAG size of output: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:05:02,069 WARN L286 SmtUtils]: Spent 16.27s on a formula simplification. DAG size of input: 77 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:05:20,245 WARN L286 SmtUtils]: Spent 16.24s on a formula simplification. DAG size of input: 81 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:05:38,112 WARN L286 SmtUtils]: Spent 16.23s on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:05:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:47,762 INFO L93 Difference]: Finished difference Result 1368 states and 1729 transitions. [2024-11-13 15:05:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-13 15:05:47,764 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 4.023809523809524) internal successors, (169), 41 states have internal predecessors, (169), 7 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 136 [2024-11-13 15:05:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:47,770 INFO L225 Difference]: With dead ends: 1368 [2024-11-13 15:05:47,770 INFO L226 Difference]: Without dead ends: 928 [2024-11-13 15:05:47,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4588 ImplicationChecksByTransitivity, 159.6s TimeCoverageRelationStatistics Valid=1798, Invalid=13702, Unknown=0, NotChecked=0, Total=15500 [2024-11-13 15:05:47,776 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1168 mSDsluCounter, 4429 mSDsCounter, 0 mSdLazyCounter, 3042 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 4609 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 3042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:47,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 4609 Invalid, 3229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [187 Valid, 3042 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2024-11-13 15:05:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-13 15:05:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 711. [2024-11-13 15:05:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 647 states have (on average 1.2009273570324575) internal successors, (777), 650 states have internal predecessors, (777), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:05:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 881 transitions. [2024-11-13 15:05:47,897 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 881 transitions. Word has length 136 [2024-11-13 15:05:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:47,897 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 881 transitions. [2024-11-13 15:05:47,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 4.023809523809524) internal successors, (169), 41 states have internal predecessors, (169), 7 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-13 15:05:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 881 transitions. [2024-11-13 15:05:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 15:05:47,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:47,900 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:05:47,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2024-11-13 15:05:48,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-13 15:05:48,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:05:48,301 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:48,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1569937866, now seen corresponding path program 1 times [2024-11-13 15:05:48,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:05:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354876291] [2024-11-13 15:05:48,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:48,302 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-13 15:05:48,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:05:48,304 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:05:48,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2024-11-13 15:05:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:49,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:05:49,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:05:51,165 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 26 treesize of output 14 [2024-11-13 15:05:51,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 15:05:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 15:05:51,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:05:51,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:05:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354876291] [2024-11-13 15:05:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354876291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:05:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:05:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:05:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371897990] [2024-11-13 15:05:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:05:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:05:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:05:51,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:05:51,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:05:51,416 INFO L87 Difference]: Start difference. First operand 711 states and 881 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:05:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:53,412 INFO L93 Difference]: Finished difference Result 1411 states and 1787 transitions. [2024-11-13 15:05:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:05:53,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 136 [2024-11-13 15:05:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:53,424 INFO L225 Difference]: With dead ends: 1411 [2024-11-13 15:05:53,424 INFO L226 Difference]: Without dead ends: 929 [2024-11-13 15:05:53,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:05:53,426 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 197 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:53,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 691 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:05:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-13 15:05:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 687. [2024-11-13 15:05:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 623 states have (on average 1.2006420545746388) internal successors, (748), 626 states have internal predecessors, (748), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:05:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 852 transitions. [2024-11-13 15:05:53,521 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 852 transitions. Word has length 136 [2024-11-13 15:05:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:53,522 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 852 transitions. [2024-11-13 15:05:53,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:05:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 852 transitions. [2024-11-13 15:05:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 15:05:53,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:53,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:05:53,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2024-11-13 15:05:53,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:05:53,724 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:53,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2044971060, now seen corresponding path program 1 times [2024-11-13 15:05:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:05:53,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360287261] [2024-11-13 15:05:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:53,726 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-13 15:05:53,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:05:53,728 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:05:53,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-11-13 15:05:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:54,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 15:05:54,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:05:57,611 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 23 treesize of output 19 [2024-11-13 15:05:57,816 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 35 treesize of output 23 [2024-11-13 15:05:58,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 15:05:58,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 15:05:58,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-13 15:05:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 15:05:58,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:06:00,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:06:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360287261] [2024-11-13 15:06:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360287261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:06:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367280647] [2024-11-13 15:06:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:00,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:06:00,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:00,148 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:06:00,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-13 15:06:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:00,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 15:06:00,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:08,834 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-13 15:06:10,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:06:14,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:06:14,300 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 14 [2024-11-13 15:06:15,610 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-11-13 15:06:15,610 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 1 case distinctions, treesize of input 33 treesize of output 40 [2024-11-13 15:06:16,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2024-11-13 15:06:22,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:06:22,491 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 72 treesize of output 38 [2024-11-13 15:06:22,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-13 15:06:22,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-11-13 15:06:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 161 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 15:06:23,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:06:34,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367280647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:06:34,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:06:34,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 40 [2024-11-13 15:06:34,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223965910] [2024-11-13 15:06:34,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:06:34,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 15:06:34,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:06:34,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 15:06:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3724, Unknown=0, NotChecked=0, Total=4160 [2024-11-13 15:06:34,236 INFO L87 Difference]: Start difference. First operand 687 states and 852 transitions. Second operand has 41 states, 39 states have (on average 4.256410256410256) internal successors, (166), 38 states have internal predecessors, (166), 6 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 15:07:10,909 WARN L286 SmtUtils]: Spent 16.24s on a formula simplification. DAG size of input: 76 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:07:29,590 WARN L286 SmtUtils]: Spent 16.41s on a formula simplification. DAG size of input: 81 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:07:46,670 WARN L286 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 75 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:07:53,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:08:10,987 WARN L286 SmtUtils]: Spent 16.37s on a formula simplification. DAG size of input: 93 DAG size of output: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:08:27,823 WARN L286 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 76 DAG size of output: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:08:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:36,002 INFO L93 Difference]: Finished difference Result 1374 states and 1732 transitions. [2024-11-13 15:08:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-13 15:08:36,004 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 4.256410256410256) internal successors, (166), 38 states have internal predecessors, (166), 6 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 136 [2024-11-13 15:08:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:36,008 INFO L225 Difference]: With dead ends: 1374 [2024-11-13 15:08:36,009 INFO L226 Difference]: Without dead ends: 906 [2024-11-13 15:08:36,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3764 ImplicationChecksByTransitivity, 119.6s TimeCoverageRelationStatistics Valid=1635, Invalid=11705, Unknown=0, NotChecked=0, Total=13340 [2024-11-13 15:08:36,014 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1124 mSDsluCounter, 4688 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 179 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 4873 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:36,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 4873 Invalid, 3427 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [179 Valid, 3247 Invalid, 1 Unknown, 0 Unchecked, 22.3s Time] [2024-11-13 15:08:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-13 15:08:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 687. [2024-11-13 15:08:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 623 states have (on average 1.2006420545746388) internal successors, (748), 626 states have internal predecessors, (748), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 15:08:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 852 transitions. [2024-11-13 15:08:36,105 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 852 transitions. Word has length 136 [2024-11-13 15:08:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:36,105 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 852 transitions. [2024-11-13 15:08:36,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 4.256410256410256) internal successors, (166), 38 states have internal predecessors, (166), 6 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 15:08:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 852 transitions. [2024-11-13 15:08:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 15:08:36,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:36,107 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 15:08:36,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2024-11-13 15:08:36,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2024-11-13 15:08:36,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:08:36,508 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:36,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1749598469, now seen corresponding path program 1 times [2024-11-13 15:08:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:08:36,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539637350] [2024-11-13 15:08:36,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:36,509 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-13 15:08:36,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:08:36,511 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:08:36,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ffd586e-bafb-48c4-be44-1ad59e6e0945/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process