./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC --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 a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:33:18,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:33:18,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:33:18,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:33:18,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:33:18,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:33:18,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:33:18,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:33:18,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:33:18,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:33:18,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:33:18,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:33:18,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:33:18,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:33:18,486 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:33:18,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:33:18,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:33:18,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:33:18,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:33:18,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:33:18,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:33:18,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:33:18,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:33:18,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:33:18,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:33:18,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:33:18,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:33:18,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:33:18,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:33:18,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:33:18,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:33:18,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:33:18,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:33:18,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:33:18,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:33:18,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:33:18,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:33:18,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:33:18,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:33:18,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:33:18,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:33:18,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:33:18,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:33:18,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:33:18,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:33:18,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:33:18,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:33:18,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:33:18,493 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_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC 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 -> a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 [2024-11-24 01:33:18,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:33:18,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:33:18,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:33:18,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:33:18,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:33:18,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-11-24 01:33:22,811 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data/2bb448912/5bb0b6bceef94c43b4c480b9b356ca0b/FLAG782c90c36 [2024-11-24 01:33:23,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:33:23,268 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-11-24 01:33:23,284 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data/2bb448912/5bb0b6bceef94c43b4c480b9b356ca0b/FLAG782c90c36 [2024-11-24 01:33:23,306 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data/2bb448912/5bb0b6bceef94c43b4c480b9b356ca0b [2024-11-24 01:33:23,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:33:23,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:33:23,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:33:23,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:33:23,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:33:23,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbc533d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23, skipping insertion in model container [2024-11-24 01:33:23,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:33:23,567 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_f884e531-8959-4b8f-b59e-305babfd2689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i[916,929] [2024-11-24 01:33:23,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:33:23,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:33:23,709 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_f884e531-8959-4b8f-b59e-305babfd2689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i[916,929] [2024-11-24 01:33:23,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:33:23,787 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:33:23,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23 WrapperNode [2024-11-24 01:33:23,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:33:23,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:33:23,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:33:23,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:33:23,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,878 INFO L138 Inliner]: procedures = 30, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2024-11-24 01:33:23,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:33:23,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:33:23,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:33:23,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:33:23,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,920 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-24 01:33:23,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:23,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:24,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:33:24,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:33:24,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:33:24,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:33:24,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (1/1) ... [2024-11-24 01:33:24,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:33:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:33:24,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:33:24,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:33:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:33:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-24 01:33:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-24 01:33:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-24 01:33:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-24 01:33:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-24 01:33:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-24 01:33:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:33:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:33:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-24 01:33:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:33:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:33:24,322 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:33:24,326 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:33:25,376 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-24 01:33:25,376 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:33:25,401 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:33:25,401 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:33:25,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:33:25 BoogieIcfgContainer [2024-11-24 01:33:25,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:33:25,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:33:25,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:33:25,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:33:25,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:33:23" (1/3) ... [2024-11-24 01:33:25,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5807234e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:33:25, skipping insertion in model container [2024-11-24 01:33:25,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:33:23" (2/3) ... [2024-11-24 01:33:25,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5807234e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:33:25, skipping insertion in model container [2024-11-24 01:33:25,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:33:25" (3/3) ... [2024-11-24 01:33:25,422 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-38.i [2024-11-24 01:33:25,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:33:25,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-38.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:33:25,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:33:25,563 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;@15b368e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:33:25,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:33:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-24 01:33:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:33:25,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:25,588 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:25,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:25,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1590797153, now seen corresponding path program 1 times [2024-11-24 01:33:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490559880] [2024-11-24 01:33:25,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-24 01:33:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:26,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490559880] [2024-11-24 01:33:26,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490559880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:33:26,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264535033] [2024-11-24 01:33:26,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:26,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:33:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:33:26,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:33:26,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:33:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:26,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:33:27,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-24 01:33:27,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:33:27,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264535033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:27,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:33:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 01:33:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23184834] [2024-11-24 01:33:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:27,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:33:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:27,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:33:27,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:33:27,132 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-24 01:33:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:27,176 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-24 01:33:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:33:27,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-24 01:33:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:27,189 INFO L225 Difference]: With dead ends: 237 [2024-11-24 01:33:27,189 INFO L226 Difference]: Without dead ends: 118 [2024-11-24 01:33:27,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:33:27,198 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:27,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:33:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-24 01:33:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-24 01:33:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-24 01:33:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-24 01:33:27,277 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-24 01:33:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:27,280 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-24 01:33:27,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-24 01:33:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-24 01:33:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:33:27,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:27,286 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:27,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:33:27,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-24 01:33:27,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash 798915143, now seen corresponding path program 1 times [2024-11-24 01:33:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147356669] [2024-11-24 01:33:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:33:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:28,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147356669] [2024-11-24 01:33:28,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147356669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:28,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:28,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:33:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783524278] [2024-11-24 01:33:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:28,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:33:28,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:28,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:33:28,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:33:28,275 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-24 01:33:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:28,373 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2024-11-24 01:33:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:33:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-24 01:33:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:28,379 INFO L225 Difference]: With dead ends: 235 [2024-11-24 01:33:28,379 INFO L226 Difference]: Without dead ends: 120 [2024-11-24 01:33:28,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:33:28,384 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:28,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:33:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-24 01:33:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-24 01:33:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-24 01:33:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2024-11-24 01:33:28,414 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 184 [2024-11-24 01:33:28,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:28,416 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2024-11-24 01:33:28,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-24 01:33:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-11-24 01:33:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:33:28,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:28,421 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:28,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:33:28,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -928229819, now seen corresponding path program 1 times [2024-11-24 01:33:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398184067] [2024-11-24 01:33:28,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:33:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:29,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398184067] [2024-11-24 01:33:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398184067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:29,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:29,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:33:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604878520] [2024-11-24 01:33:29,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:29,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:33:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:29,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:33:29,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:33:29,014 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-24 01:33:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:29,097 INFO L93 Difference]: Finished difference Result 240 states and 349 transitions. [2024-11-24 01:33:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:33:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-24 01:33:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:29,103 INFO L225 Difference]: With dead ends: 240 [2024-11-24 01:33:29,105 INFO L226 Difference]: Without dead ends: 123 [2024-11-24 01:33:29,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:33:29,107 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:29,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:33:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-24 01:33:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-24 01:33:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-24 01:33:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2024-11-24 01:33:29,136 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 184 [2024-11-24 01:33:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:29,138 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2024-11-24 01:33:29,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-24 01:33:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-11-24 01:33:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:33:29,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:29,146 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:29,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:33:29,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:29,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash -248171449, now seen corresponding path program 1 times [2024-11-24 01:33:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:29,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237524441] [2024-11-24 01:33:29,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:33:33,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237524441] [2024-11-24 01:33:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237524441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:33:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644117673] [2024-11-24 01:33:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:33,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:33:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:33,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:33:33,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:33:33,473 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-24 01:33:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:34,591 INFO L93 Difference]: Finished difference Result 328 states and 474 transitions. [2024-11-24 01:33:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:33:34,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-24 01:33:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:34,596 INFO L225 Difference]: With dead ends: 328 [2024-11-24 01:33:34,596 INFO L226 Difference]: Without dead ends: 209 [2024-11-24 01:33:34,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:33:34,598 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 197 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:34,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 419 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 01:33:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-24 01:33:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-24 01:33:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 167 states have (on average 1.341317365269461) internal successors, (224), 168 states have internal predecessors, (224), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 01:33:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2024-11-24 01:33:34,643 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 184 [2024-11-24 01:33:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:34,644 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2024-11-24 01:33:34,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-24 01:33:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2024-11-24 01:33:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:33:34,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:34,653 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:34,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:33:34,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:34,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1745863815, now seen corresponding path program 1 times [2024-11-24 01:33:34,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:34,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920182521] [2024-11-24 01:33:34,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:34,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:33:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920182521] [2024-11-24 01:33:41,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920182521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:41,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:41,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:33:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354869603] [2024-11-24 01:33:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:41,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:33:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:41,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:33:41,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:33:41,514 INFO L87 Difference]: Start difference. First operand 206 states and 296 transitions. Second operand has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-24 01:33:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:44,617 INFO L93 Difference]: Finished difference Result 491 states and 704 transitions. [2024-11-24 01:33:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:33:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-24 01:33:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:44,628 INFO L225 Difference]: With dead ends: 491 [2024-11-24 01:33:44,628 INFO L226 Difference]: Without dead ends: 288 [2024-11-24 01:33:44,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:33:44,633 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 50 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:44,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 970 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-24 01:33:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-24 01:33:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 228. [2024-11-24 01:33:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.343915343915344) internal successors, (254), 190 states have internal predecessors, (254), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 01:33:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 326 transitions. [2024-11-24 01:33:44,678 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 326 transitions. Word has length 184 [2024-11-24 01:33:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:44,680 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 326 transitions. [2024-11-24 01:33:44,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-24 01:33:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 326 transitions. [2024-11-24 01:33:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:33:44,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:44,687 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:44,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:33:44,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:44,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1159057801, now seen corresponding path program 1 times [2024-11-24 01:33:44,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:44,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792961325] [2024-11-24 01:33:44,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:33:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:50,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792961325] [2024-11-24 01:33:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792961325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:50,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:50,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 01:33:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801782956] [2024-11-24 01:33:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:50,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:33:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:50,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:33:50,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:33:50,093 INFO L87 Difference]: Start difference. First operand 228 states and 326 transitions. Second operand has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-24 01:33:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:52,144 INFO L93 Difference]: Finished difference Result 505 states and 722 transitions. [2024-11-24 01:33:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:33:52,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-24 01:33:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:52,148 INFO L225 Difference]: With dead ends: 505 [2024-11-24 01:33:52,150 INFO L226 Difference]: Without dead ends: 280 [2024-11-24 01:33:52,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:33:52,153 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:52,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 900 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-24 01:33:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-24 01:33:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 228. [2024-11-24 01:33:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3333333333333333) internal successors, (252), 190 states have internal predecessors, (252), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 01:33:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 324 transitions. [2024-11-24 01:33:52,192 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 324 transitions. Word has length 184 [2024-11-24 01:33:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:52,193 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 324 transitions. [2024-11-24 01:33:52,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-24 01:33:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 324 transitions. [2024-11-24 01:33:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:33:52,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:52,197 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:52,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:33:52,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:52,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1964718533, now seen corresponding path program 1 times [2024-11-24 01:33:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:52,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403827932] [2024-11-24 01:33:52,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:52,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:33:56,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:33:56,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403827932] [2024-11-24 01:33:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403827932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:33:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:33:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 01:33:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872203689] [2024-11-24 01:33:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:33:56,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:33:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:33:56,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:33:56,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:33:56,937 INFO L87 Difference]: Start difference. First operand 228 states and 324 transitions. Second operand has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-24 01:33:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:33:58,877 INFO L93 Difference]: Finished difference Result 505 states and 718 transitions. [2024-11-24 01:33:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:33:58,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-24 01:33:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:33:58,882 INFO L225 Difference]: With dead ends: 505 [2024-11-24 01:33:58,882 INFO L226 Difference]: Without dead ends: 280 [2024-11-24 01:33:58,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:33:58,884 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 47 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:33:58,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 834 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-24 01:33:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-24 01:33:58,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 228. [2024-11-24 01:33:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3227513227513228) internal successors, (250), 190 states have internal predecessors, (250), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 01:33:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2024-11-24 01:33:58,914 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 184 [2024-11-24 01:33:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:33:58,915 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2024-11-24 01:33:58,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-24 01:33:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2024-11-24 01:33:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:33:58,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:33:58,922 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:33:58,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:33:58,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:33:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:33:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1377912519, now seen corresponding path program 1 times [2024-11-24 01:33:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:33:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562302884] [2024-11-24 01:33:58,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:58,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:33:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:34:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:34:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:34:10,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562302884] [2024-11-24 01:34:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562302884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:34:10,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:34:10,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:34:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945257528] [2024-11-24 01:34:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:34:10,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:34:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:34:10,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:34:10,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:34:10,782 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-24 01:34:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:34:21,499 INFO L93 Difference]: Finished difference Result 517 states and 728 transitions. [2024-11-24 01:34:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:34:21,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 184 [2024-11-24 01:34:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:34:21,507 INFO L225 Difference]: With dead ends: 517 [2024-11-24 01:34:21,509 INFO L226 Difference]: Without dead ends: 292 [2024-11-24 01:34:21,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-24 01:34:21,512 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 52 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:34:21,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1682 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-24 01:34:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-24 01:34:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-24 01:34:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 243 states have (on average 1.3333333333333333) internal successors, (324), 246 states have internal predecessors, (324), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-24 01:34:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2024-11-24 01:34:21,554 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 184 [2024-11-24 01:34:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:34:21,555 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2024-11-24 01:34:21,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-24 01:34:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2024-11-24 01:34:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-24 01:34:21,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:34:21,559 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:34:21,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:34:21,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:34:21,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:34:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1715445312, now seen corresponding path program 1 times [2024-11-24 01:34:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:34:21,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352289430] [2024-11-24 01:34:21,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:34:21,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:34:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:34:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 18 proven. 114 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-24 01:34:27,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:34:27,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352289430] [2024-11-24 01:34:27,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352289430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:34:27,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813925602] [2024-11-24 01:34:27,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:34:27,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:34:27,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:34:27,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:34:27,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:34:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:34:28,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-24 01:34:28,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:34:28,576 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 25 treesize of output 13 [2024-11-24 01:34:28,696 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 25 treesize of output 13 [2024-11-24 01:34:29,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:29,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:29,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:29,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:29,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:29,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:29,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:29,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:29,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:29,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:29,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:29,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:30,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:30,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:30,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:30,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:30,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:30,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:30,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:30,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:30,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:30,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:30,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-24 01:34:31,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:34:31,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 64 [2024-11-24 01:34:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 344 proven. 120 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-24 01:34:31,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:34:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-24 01:34:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813925602] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:34:32,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:34:32,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 32 [2024-11-24 01:34:32,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118432604] [2024-11-24 01:34:32,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:34:32,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-24 01:34:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:34:32,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-24 01:34:32,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-11-24 01:34:32,287 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 32 states, 25 states have (on average 7.0) internal successors, (175), 32 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) [2024-11-24 01:34:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:34:37,774 INFO L93 Difference]: Finished difference Result 621 states and 842 transitions. [2024-11-24 01:34:37,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-24 01:34:37,776 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 7.0) internal successors, (175), 32 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) Word has length 186 [2024-11-24 01:34:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:34:37,781 INFO L225 Difference]: With dead ends: 621 [2024-11-24 01:34:37,782 INFO L226 Difference]: Without dead ends: 336 [2024-11-24 01:34:37,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=602, Invalid=2590, Unknown=0, NotChecked=0, Total=3192 [2024-11-24 01:34:37,787 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 885 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:34:37,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 710 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-24 01:34:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-24 01:34:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 252. [2024-11-24 01:34:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 205 states have (on average 1.278048780487805) internal successors, (262), 206 states have internal predecessors, (262), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 01:34:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 334 transitions. [2024-11-24 01:34:37,860 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 334 transitions. Word has length 186 [2024-11-24 01:34:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:34:37,861 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 334 transitions. [2024-11-24 01:34:37,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 7.0) internal successors, (175), 32 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) [2024-11-24 01:34:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 334 transitions. [2024-11-24 01:34:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-24 01:34:37,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:34:37,870 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:34:37,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 01:34:38,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:34:38,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:34:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:34:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1496590594, now seen corresponding path program 1 times [2024-11-24 01:34:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:34:38,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170744143] [2024-11-24 01:34:38,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:34:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:34:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:34:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 01:34:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:34:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170744143] [2024-11-24 01:34:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170744143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:34:42,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:34:42,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 01:34:42,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487847693] [2024-11-24 01:34:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:34:42,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:34:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:34:42,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:34:42,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:34:42,454 INFO L87 Difference]: Start difference. First operand 252 states and 334 transitions. Second operand has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-24 01:34:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:34:44,110 INFO L93 Difference]: Finished difference Result 501 states and 665 transitions. [2024-11-24 01:34:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:34:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 186 [2024-11-24 01:34:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:34:44,114 INFO L225 Difference]: With dead ends: 501 [2024-11-24 01:34:44,114 INFO L226 Difference]: Without dead ends: 252 [2024-11-24 01:34:44,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:34:44,116 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 44 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:34:44,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 656 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-24 01:34:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-24 01:34:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-24 01:34:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 205 states have (on average 1.2682926829268293) internal successors, (260), 206 states have internal predecessors, (260), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 01:34:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 332 transitions. [2024-11-24 01:34:44,163 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 332 transitions. Word has length 186 [2024-11-24 01:34:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:34:44,165 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 332 transitions. [2024-11-24 01:34:44,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.5) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-24 01:34:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 332 transitions. [2024-11-24 01:34:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-24 01:34:44,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:34:44,171 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:34:44,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:34:44,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:34:44,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:34:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1238425156, now seen corresponding path program 1 times [2024-11-24 01:34:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:34:44,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421322352] [2024-11-24 01:34:44,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:34:44,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:34:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:34:44,408 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:34:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:34:44,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:34:44,643 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:34:44,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:34:44,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:34:44,651 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:34:44,738 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:34:44,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:34:44 BoogieIcfgContainer [2024-11-24 01:34:44,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:34:44,745 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:34:44,745 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:34:44,746 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:34:44,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:33:25" (3/4) ... [2024-11-24 01:34:44,750 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:34:44,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:34:44,752 INFO L158 Benchmark]: Toolchain (without parser) took 81441.10ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 104.5MB in the beginning and 157.1MB in the end (delta: -52.6MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2024-11-24 01:34:44,752 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:34:44,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.76ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 86.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 01:34:44,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.73ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 81.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:34:44,753 INFO L158 Benchmark]: Boogie Preprocessor took 125.07ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 78.0MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:34:44,758 INFO L158 Benchmark]: RCFGBuilder took 1398.46ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 43.8MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-24 01:34:44,758 INFO L158 Benchmark]: TraceAbstraction took 79337.26ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 43.1MB in the beginning and 157.2MB in the end (delta: -114.0MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-11-24 01:34:44,758 INFO L158 Benchmark]: Witness Printer took 5.95ms. Allocated memory is still 285.2MB. Free memory was 157.2MB in the beginning and 157.1MB in the end (delta: 87.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:34:44,760 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.00ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.76ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 86.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.73ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 81.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 125.07ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 78.0MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1398.46ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 43.8MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 79337.26ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 43.1MB in the beginning and 157.2MB in the end (delta: -114.0MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Witness Printer took 5.95ms. Allocated memory is still 285.2MB. Free memory was 157.2MB in the beginning and 157.1MB in the end (delta: 87.6kB). 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 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L43] unsigned char isInitial = 0; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L135] isInitial = 1 [L136] FCALL initially() [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L96] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1610612735) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1610612735) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16384) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16384) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L121] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L139] RET updateVariables() [L140] CALL step() [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR WrapperStruct00.var_1_4 [L68] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4) [L69] EXPR WrapperStruct00.var_1_2 [L69] unsigned short int stepLocal_0 = WrapperStruct00.var_1_2; [L70] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-2] [L70] COND FALSE !(WrapperStruct00.var_1_4 > stepLocal_0) [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 [L73] EXPR WrapperStruct00.var_1_11 [L73] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))) [L74] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L74] COND TRUE ! WrapperStruct00.var_1_13 [L75] EXPR WrapperStruct00.var_1_3 [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_15 [L75] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)) [L83] EXPR WrapperStruct00.var_1_19 [L83] unsigned char stepLocal_1 = WrapperStruct00.var_1_19; [L84] EXPR WrapperStruct00.var_1_13 [L84] EXPR WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=-256] [L84] COND FALSE !((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && stepLocal_1) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) [L131] EXPR WrapperStruct00.var_1_7 [L131] EXPR WrapperStruct00.var_1_8 [L131] EXPR WrapperStruct00.var_1_9 [L131] EXPR WrapperStruct00.var_1_10 [L131] EXPR WrapperStruct00.var_1_11 [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131-L132] return ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 79.1s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1340 SdHoareTripleChecker+Valid, 22.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1324 mSDsluCounter, 7338 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5818 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4970 IncrementalHoareTripleChecker+Invalid, 5217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 1520 mSDtfsCounter, 4970 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 798 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=8, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 256 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 46.4s InterpolantComputationTime, 2400 NumberOfCodeBlocks, 2400 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2387 ConstructedInterpolants, 0 QuantifiedInterpolants, 10177 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1324 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 13949/14352 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 01:34:44,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/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_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC --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 a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:34:48,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:34:48,421 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:34:48,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:34:48,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:34:48,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:34:48,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:34:48,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:34:48,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:34:48,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:34:48,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:34:48,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:34:48,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:34:48,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:34:48,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:34:48,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:34:48,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:34:48,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:34:48,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:34:48,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:34:48,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:34:48,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:34:48,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:34:48,490 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:34:48,490 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:34:48,491 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:34:48,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:34:48,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:34:48,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:34:48,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:34:48,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:34:48,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:34:48,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:34:48,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:34:48,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:34:48,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:34:48,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:34:48,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:34:48,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:34:48,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:34:48,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:34:48,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:34:48,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:34:48,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:34:48,495 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:34:48,496 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:34:48,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:34:48,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:34:48,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:34:48,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:34:48,497 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_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC 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 -> a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 [2024-11-24 01:34:49,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:34:49,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:34:49,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:34:49,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:34:49,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:34:49,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-11-24 01:34:53,218 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data/7a4b62b46/912408071ab94bd5a184e9cb2127992b/FLAG1c6a5b8e0 [2024-11-24 01:34:53,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:34:53,629 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-11-24 01:34:53,645 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data/7a4b62b46/912408071ab94bd5a184e9cb2127992b/FLAG1c6a5b8e0 [2024-11-24 01:34:53,677 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/data/7a4b62b46/912408071ab94bd5a184e9cb2127992b [2024-11-24 01:34:53,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:34:53,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:34:53,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:34:53,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:34:53,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:34:53,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:34:53" (1/1) ... [2024-11-24 01:34:53,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f6cacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:53, skipping insertion in model container [2024-11-24 01:34:53,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:34:53" (1/1) ... [2024-11-24 01:34:53,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:34:53,944 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_f884e531-8959-4b8f-b59e-305babfd2689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i[916,929] [2024-11-24 01:34:54,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:34:54,175 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:34:54,194 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_f884e531-8959-4b8f-b59e-305babfd2689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i[916,929] [2024-11-24 01:34:54,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:34:54,367 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:34:54,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54 WrapperNode [2024-11-24 01:34:54,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:34:54,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:34:54,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:34:54,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:34:54,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,483 INFO L138 Inliner]: procedures = 37, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2024-11-24 01:34:54,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:34:54,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:34:54,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:34:54,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:34:54,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,550 INFO L175 MemorySlicer]: Split 142 memory accesses to 2 slices as follows [2, 140]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 41 writes are split as follows [0, 41]. [2024-11-24 01:34:54,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,577 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:34:54,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:34:54,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:34:54,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:34:54,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (1/1) ... [2024-11-24 01:34:54,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:34:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:34:54,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:34:54,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:34:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:34:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-24 01:34:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-24 01:34:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-24 01:34:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-24 01:34:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-24 01:34:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-24 01:34:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-24 01:34:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-24 01:34:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:34:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 01:34:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-24 01:34:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-24 01:34:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-24 01:34:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-24 01:34:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-24 01:34:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-24 01:34:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-24 01:34:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-24 01:34:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-24 01:34:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-24 01:34:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:34:54,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:34:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:34:54,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:34:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-24 01:34:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-24 01:34:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-24 01:34:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-24 01:34:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-24 01:34:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-24 01:34:54,863 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:34:54,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:35:05,866 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-24 01:35:05,866 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:35:05,882 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:35:05,882 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:35:05,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:35:05 BoogieIcfgContainer [2024-11-24 01:35:05,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:35:05,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:35:05,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:35:05,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:35:05,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:34:53" (1/3) ... [2024-11-24 01:35:05,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2203f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:35:05, skipping insertion in model container [2024-11-24 01:35:05,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:34:54" (2/3) ... [2024-11-24 01:35:05,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2203f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:35:05, skipping insertion in model container [2024-11-24 01:35:05,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:35:05" (3/3) ... [2024-11-24 01:35:05,898 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-38.i [2024-11-24 01:35:05,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:35:05,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-38.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:35:06,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:35:06,063 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;@576cf416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:35:06,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:35:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-24 01:35:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:35:06,095 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:35:06,096 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:35:06,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:35:06,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:35:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash 695157323, now seen corresponding path program 1 times [2024-11-24 01:35:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:35:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409448474] [2024-11-24 01:35:06,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:35:06,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-24 01:35:06,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:35:06,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:35:06,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:35:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:35:06,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:35:06,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:35:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2024-11-24 01:35:07,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:35:07,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:35:07,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409448474] [2024-11-24 01:35:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409448474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:35:07,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:35:07,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:35:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447825413] [2024-11-24 01:35:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:35:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:35:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:35:07,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:35:07,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:35:07,115 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-24 01:35:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:35:07,176 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-24 01:35:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:35:07,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-24 01:35:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:35:07,191 INFO L225 Difference]: With dead ends: 237 [2024-11-24 01:35:07,191 INFO L226 Difference]: Without dead ends: 118 [2024-11-24 01:35:07,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:35:07,203 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:35:07,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:35:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-24 01:35:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-24 01:35:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-24 01:35:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-24 01:35:07,261 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-24 01:35:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:35:07,261 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-24 01:35:07,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-24 01:35:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-24 01:35:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:35:07,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:35:07,270 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:35:07,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:35:07,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:35:07,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:35:07,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:35:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1210097677, now seen corresponding path program 1 times [2024-11-24 01:35:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:35:07,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018313750] [2024-11-24 01:35:07,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:35:07,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-24 01:35:07,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:35:07,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:35:07,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:35:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:35:08,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-24 01:35:08,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:35:08,725 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-24 01:35:08,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-24 01:35:09,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:09,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2024-11-24 01:35:10,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:10,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 47 [2024-11-24 01:35:11,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:11,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 47 [2024-11-24 01:35:12,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:12,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 67 [2024-11-24 01:35:17,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:17,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 68 [2024-11-24 01:35:18,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:18,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 88 [2024-11-24 01:35:27,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:27,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 104 [2024-11-24 01:35:28,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:28,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 97 treesize of output 117 [2024-11-24 01:35:30,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:30,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 130 [2024-11-24 01:35:32,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:32,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 122 treesize of output 133 [2024-11-24 01:35:33,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:33,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 122 treesize of output 133 [2024-11-24 01:35:35,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:35,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 122 treesize of output 133 [2024-11-24 01:35:37,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 135 [2024-11-24 01:35:37,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:37,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 131 treesize of output 53 [2024-11-24 01:35:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 789 proven. 177 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-24 01:35:37,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:35:41,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:35:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018313750] [2024-11-24 01:35:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018313750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:35:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [792165274] [2024-11-24 01:35:41,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:35:41,028 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-24 01:35:41,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/cvc4 [2024-11-24 01:35:41,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-24 01:35:41,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-24 01:35:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:35:44,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-24 01:35:44,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:35:45,004 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-24 01:35:45,080 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-24 01:35:45,147 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-24 01:35:45,215 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-24 01:35:45,609 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 21 treesize of output 20 [2024-11-24 01:35:46,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:46,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-11-24 01:35:46,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:46,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-24 01:35:46,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:46,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 72 [2024-11-24 01:35:47,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2024-11-24 01:35:47,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:47,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 77 treesize of output 86 [2024-11-24 01:35:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-24 01:35:48,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:35:48,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [792165274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:35:48,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:35:48,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23] total 31 [2024-11-24 01:35:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063249881] [2024-11-24 01:35:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:35:48,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:35:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:35:48,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:35:48,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1283, Unknown=3, NotChecked=0, Total=1560 [2024-11-24 01:35:48,586 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 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-24 01:35:49,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:35:50,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:35:54,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:36:01,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:36:05,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:36:12,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:36:16,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:36:20,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:36:22,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:36:25,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:36:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:36:26,132 INFO L93 Difference]: Finished difference Result 308 states and 449 transitions. [2024-11-24 01:36:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:36:26,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 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 184 [2024-11-24 01:36:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:36:26,138 INFO L225 Difference]: With dead ends: 308 [2024-11-24 01:36:26,138 INFO L226 Difference]: Without dead ends: 193 [2024-11-24 01:36:26,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=301, Invalid=1502, Unknown=3, NotChecked=0, Total=1806 [2024-11-24 01:36:26,145 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 328 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:36:26,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 343 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 413 Invalid, 4 Unknown, 0 Unchecked, 37.0s Time] [2024-11-24 01:36:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-24 01:36:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2024-11-24 01:36:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-24 01:36:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 178 transitions. [2024-11-24 01:36:26,179 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 178 transitions. Word has length 184 [2024-11-24 01:36:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:36:26,181 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 178 transitions. [2024-11-24 01:36:26,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 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-24 01:36:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 178 transitions. [2024-11-24 01:36:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 01:36:26,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:36:26,189 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:36:26,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-24 01:36:26,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:36:26,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:36:26,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:36:26,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:36:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash 783937587, now seen corresponding path program 1 times [2024-11-24 01:36:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:36:26,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983613414] [2024-11-24 01:36:26,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:36:26,594 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-24 01:36:26,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:36:26,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:36:26,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/mathsat -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-24 01:36:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:36:27,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-24 01:36:27,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:36:27,639 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-24 01:36:27,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-24 01:36:28,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:28,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2024-11-24 01:36:29,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:29,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 47 [2024-11-24 01:36:30,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:30,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 57 [2024-11-24 01:36:34,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:34,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 55 [2024-11-24 01:36:35,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:35,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 75 [2024-11-24 01:36:44,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:44,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 91 [2024-11-24 01:36:57,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:57,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 104 [2024-11-24 01:36:59,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:36:59,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 102 treesize of output 107 [2024-11-24 01:37:00,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:00,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 97 treesize of output 117 [2024-11-24 01:37:02,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:02,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 130 [2024-11-24 01:37:04,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:04,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 122 treesize of output 133 [2024-11-24 01:37:05,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:05,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 122 treesize of output 133 [2024-11-24 01:37:08,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 135 [2024-11-24 01:37:08,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:08,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 131 treesize of output 53 [2024-11-24 01:37:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 829 proven. 177 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-24 01:37:08,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:37:11,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:37:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983613414] [2024-11-24 01:37:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983613414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:37:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1103135138] [2024-11-24 01:37:11,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:11,138 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-24 01:37:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/cvc4 [2024-11-24 01:37:11,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-24 01:37:11,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f884e531-8959-4b8f-b59e-305babfd2689/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-24 01:37:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:13,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-24 01:37:13,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:37:14,127 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-24 01:37:15,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-24 01:37:15,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-24 01:37:17,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:17,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-24 01:37:18,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:18,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2024-11-24 01:37:22,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:22,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2024-11-24 01:37:31,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:31,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 68 [2024-11-24 01:37:32,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:32,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 76 [2024-11-24 01:37:45,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:45,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 70 treesize of output 87 [2024-11-24 01:37:47,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:47,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 81 treesize of output 90 [2024-11-24 01:37:48,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:48,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 78 treesize of output 98 [2024-11-24 01:37:49,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:49,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 89 treesize of output 101 [2024-11-24 01:37:50,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:50,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 86 treesize of output 109 [2024-11-24 01:37:52,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:52,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 97 treesize of output 112 [2024-11-24 01:37:54,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 112 [2024-11-24 01:37:54,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:54,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 98 treesize of output 50 [2024-11-24 01:37:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 876 proven. 120 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-24 01:37:54,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:37:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-24 01:37:57,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1103135138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:37:57,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:37:57,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 12] total 50 [2024-11-24 01:37:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955611924] [2024-11-24 01:37:57,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:37:57,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-24 01:37:57,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:37:57,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-24 01:37:57,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=2520, Unknown=12, NotChecked=0, Total=3192 [2024-11-24 01:37:57,010 INFO L87 Difference]: Start difference. First operand 123 states and 178 transitions. Second operand has 50 states, 43 states have (on average 5.27906976744186) internal successors, (227), 49 states have internal predecessors, (227), 27 states have call successors, (72), 20 states have call predecessors, (72), 26 states have return successors, (72), 20 states have call predecessors, (72), 27 states have call successors, (72) [2024-11-24 01:37:58,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:59,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:38:01,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:38:03,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:38:04,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:38:08,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:38:10,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:38:12,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:14,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:38:16,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:38:23,266 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-24 01:38:27,278 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-24 01:38:31,281 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-24 01:38:35,320 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-24 01:38:39,325 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-24 01:38:43,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:39:11,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:39:15,649 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-24 01:39:19,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:39:23,734 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-24 01:39:27,740 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-24 01:39:31,743 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-24 01:40:00,003 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-24 01:40:04,015 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-24 01:40:08,019 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-24 01:40:12,047 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-24 01:40:16,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:40:20,056 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-24 01:40:24,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:40:28,070 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-24 01:40:32,074 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-24 01:40:36,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:40:40,084 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-24 01:40:44,088 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-24 01:41:12,325 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-24 01:41:16,328 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-24 01:41:20,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:41:24,366 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-24 01:41:28,370 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-24 01:41:32,374 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-24 01:42:00,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:42:04,626 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-24 01:42:08,630 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-24 01:42:12,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:42:16,642 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-24 01:42:20,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:42:24,694 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-24 01:42:28,704 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-24 01:42:32,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:42:36,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:42:40,770 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-24 01:42:44,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:42:48,822 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-24 01:42:52,832 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-24 01:42:56,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:43:00,869 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-24 01:43:04,872 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-24 01:43:08,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:43:12,932 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-24 01:43:16,942 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-24 01:43:20,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:43:24,993 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-24 01:43:28,997 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-24 01:43:33,001 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-24 01:43:37,074 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-24 01:43:41,083 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-24 01:43:45,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:43:49,122 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-24 01:43:53,126 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-24 01:43:57,131 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-24 01:44:01,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:44:05,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:44:09,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:44:13,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:44:49,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:44:53,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:44:57,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:45:02,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:45:06,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:45:10,013 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-24 01:45:14,017 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-24 01:45:18,021 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-24 01:45:22,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:45:26,033 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-24 01:45:30,037 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-24 01:45:34,040 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-24 01:45:38,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:45:42,053 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-24 01:45:46,057 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-24 01:45:50,061 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-24 01:45:54,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:45:58,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:46:02,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:46:06,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:46:10,259 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-24 01:46:14,269 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-24 01:46:18,287 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-24 01:46:22,291 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-24 01:46:26,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:46:30,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:46:34,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:46:38,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:46:42,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:46:46,559 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-24 01:46:50,562 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-24 01:46:54,565 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-24 01:46:58,570 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-24 01:47:02,584 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-24 01:47:06,586 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-24 01:47:10,591 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]