./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU --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 6d3c7b5e20b9cb5aff7067fd2169333c3619ec19d2be169214693b588a238e0b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:10,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:10,370 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:19:10,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:10,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:10,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:10,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:10,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:10,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:19:10,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:19:10,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:19:10,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:19:10,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:10,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:10,425 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:10,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:10,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:19:10,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:10,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:19:10,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:10,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:10,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:19:10,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:19:10,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:19:10,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:10,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:10,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:10,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:10,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:10,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:10,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:19:10,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:19:10,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:10,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:10,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:19:10,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:19:10,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:19:10,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:19:10,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:19:10,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:19:10,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:19:10,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:19:10,439 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 6d3c7b5e20b9cb5aff7067fd2169333c3619ec19d2be169214693b588a238e0b [2024-10-31 22:19:10,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:10,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:10,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:10,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:10,784 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:10,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i Unable to find full path for "g++" [2024-10-31 22:19:12,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:13,133 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:13,136 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i [2024-10-31 22:19:13,148 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/data/30a875ab7/e5278742f19a491eb1c6e96df2ceadf3/FLAG1b9c346a2 [2024-10-31 22:19:13,174 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/data/30a875ab7/e5278742f19a491eb1c6e96df2ceadf3 [2024-10-31 22:19:13,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:13,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:13,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:13,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:13,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:13,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d0f8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13, skipping insertion in model container [2024-10-31 22:19:13,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:13,434 WARN L251 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_77269d7a-f55d-4817-94dc-94c4e3564fc6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i[916,929] [2024-10-31 22:19:13,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:13,499 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:13,511 WARN L251 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_77269d7a-f55d-4817-94dc-94c4e3564fc6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i[916,929] [2024-10-31 22:19:13,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:13,569 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:13,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13 WrapperNode [2024-10-31 22:19:13,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:13,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:13,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:13,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:13,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,640 INFO L138 Inliner]: procedures = 29, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 395 [2024-10-31 22:19:13,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:13,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:13,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:13,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:13,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,695 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-10-31 22:19:13,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:13,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:13,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:13,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:13,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (1/1) ... [2024-10-31 22:19:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:13,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:13,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:13,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:19:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:19:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:19:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:19:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:19:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:19:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:19:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:19:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:19:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:19:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:19:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:19:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:19:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:19:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:14,012 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:14,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:14,593 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-31 22:19:14,593 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:14,607 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:14,607 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:19:14,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:14 BoogieIcfgContainer [2024-10-31 22:19:14,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:14,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:19:14,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:19:14,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:19:14,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:19:13" (1/3) ... [2024-10-31 22:19:14,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0cc9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:14, skipping insertion in model container [2024-10-31 22:19:14,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:13" (2/3) ... [2024-10-31 22:19:14,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0cc9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:14, skipping insertion in model container [2024-10-31 22:19:14,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:14" (3/3) ... [2024-10-31 22:19:14,622 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-21.i [2024-10-31 22:19:14,642 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:19:14,642 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:19:14,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:19:14,720 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;@1f880db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:19:14,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:19:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-31 22:19:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:19:14,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:14,734 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:14,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:14,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 306818116, now seen corresponding path program 1 times [2024-10-31 22:19:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078603996] [2024-10-31 22:19:14,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:14,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:15,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078603996] [2024-10-31 22:19:15,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078603996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:15,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927016360] [2024-10-31 22:19:15,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:19:15,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:15,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:19:15,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:19:15,186 INFO L87 Difference]: Start difference. First operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:19:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:15,214 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-10-31 22:19:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:19:15,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-10-31 22:19:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:15,223 INFO L225 Difference]: With dead ends: 185 [2024-10-31 22:19:15,223 INFO L226 Difference]: Without dead ends: 92 [2024-10-31 22:19:15,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-10-31 22:19:15,229 INFO L432 NwaCegarLoop]: 135 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, 135 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-10-31 22:19:15,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-31 22:19:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-31 22:19:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-31 22:19:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-10-31 22:19:15,303 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2024-10-31 22:19:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:15,304 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-10-31 22:19:15,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:19:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-10-31 22:19:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:19:15,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:15,308 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:15,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:19:15,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:15,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1397824002, now seen corresponding path program 1 times [2024-10-31 22:19:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:15,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948692241] [2024-10-31 22:19:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:15,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:16,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948692241] [2024-10-31 22:19:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948692241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:19:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577154405] [2024-10-31 22:19:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:16,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:19:16,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:19:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:19:16,382 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:16,948 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2024-10-31 22:19:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:16,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2024-10-31 22:19:16,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:16,951 INFO L225 Difference]: With dead ends: 301 [2024-10-31 22:19:16,951 INFO L226 Difference]: Without dead ends: 212 [2024-10-31 22:19:16,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:19:16,958 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 231 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:16,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 483 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:19:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-31 22:19:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2024-10-31 22:19:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.4404761904761905) internal successors, (242), 168 states have internal predecessors, (242), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:19:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 270 transitions. [2024-10-31 22:19:16,994 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 270 transitions. Word has length 80 [2024-10-31 22:19:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:16,995 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 270 transitions. [2024-10-31 22:19:16,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2024-10-31 22:19:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-31 22:19:17,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:17,003 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:17,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:19:17,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:17,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:17,004 INFO L85 PathProgramCache]: Analyzing trace with hash 986714953, now seen corresponding path program 1 times [2024-10-31 22:19:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:17,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265125599] [2024-10-31 22:19:17,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:17,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:17,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265125599] [2024-10-31 22:19:17,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265125599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:17,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001043487] [2024-10-31 22:19:17,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:17,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:17,223 INFO L87 Difference]: Start difference. First operand 185 states and 270 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:17,277 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2024-10-31 22:19:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:19:17,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-10-31 22:19:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:17,279 INFO L225 Difference]: With dead ends: 370 [2024-10-31 22:19:17,279 INFO L226 Difference]: Without dead ends: 188 [2024-10-31 22:19:17,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:17,285 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:17,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-31 22:19:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-31 22:19:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.4269005847953216) internal successors, (244), 171 states have internal predecessors, (244), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:19:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 272 transitions. [2024-10-31 22:19:17,318 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 272 transitions. Word has length 83 [2024-10-31 22:19:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:17,320 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 272 transitions. [2024-10-31 22:19:17,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2024-10-31 22:19:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-31 22:19:17,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:17,325 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:17,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:19:17,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:17,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -863945486, now seen corresponding path program 1 times [2024-10-31 22:19:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94078900] [2024-10-31 22:19:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:18,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94078900] [2024-10-31 22:19:18,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94078900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:18,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:19:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430315497] [2024-10-31 22:19:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:18,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:19:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:18,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:19:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:19:18,768 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:19:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:19,658 INFO L93 Difference]: Finished difference Result 582 states and 833 transitions. [2024-10-31 22:19:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:19:19,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2024-10-31 22:19:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:19,662 INFO L225 Difference]: With dead ends: 582 [2024-10-31 22:19:19,662 INFO L226 Difference]: Without dead ends: 397 [2024-10-31 22:19:19,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:19:19,668 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 150 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:19,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 935 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:19:19,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-31 22:19:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 305. [2024-10-31 22:19:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 280 states have (on average 1.4142857142857144) internal successors, (396), 282 states have internal predecessors, (396), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:19:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 436 transitions. [2024-10-31 22:19:19,723 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 436 transitions. Word has length 87 [2024-10-31 22:19:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:19,724 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 436 transitions. [2024-10-31 22:19:19,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:19:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 436 transitions. [2024-10-31 22:19:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-31 22:19:19,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:19,733 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:19,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:19:19,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:19,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -907307414, now seen corresponding path program 1 times [2024-10-31 22:19:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90016330] [2024-10-31 22:19:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90016330] [2024-10-31 22:19:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90016330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:19:20,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975793158] [2024-10-31 22:19:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:19:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:19:20,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:19:20,926 INFO L87 Difference]: Start difference. First operand 305 states and 436 transitions. Second operand has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 22:19:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:21,580 INFO L93 Difference]: Finished difference Result 655 states and 931 transitions. [2024-10-31 22:19:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:19:21,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 88 [2024-10-31 22:19:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:21,586 INFO L225 Difference]: With dead ends: 655 [2024-10-31 22:19:21,587 INFO L226 Difference]: Without dead ends: 484 [2024-10-31 22:19:21,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:19:21,589 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 70 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:21,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 809 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:19:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-31 22:19:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 308. [2024-10-31 22:19:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 283 states have (on average 1.4098939929328622) internal successors, (399), 285 states have internal predecessors, (399), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:19:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 439 transitions. [2024-10-31 22:19:21,621 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 439 transitions. Word has length 88 [2024-10-31 22:19:21,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:21,622 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 439 transitions. [2024-10-31 22:19:21,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 22:19:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 439 transitions. [2024-10-31 22:19:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-31 22:19:21,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:21,624 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:21,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:19:21,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash -438132547, now seen corresponding path program 1 times [2024-10-31 22:19:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853316924] [2024-10-31 22:19:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:21,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853316924] [2024-10-31 22:19:21,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853316924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:19:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703327323] [2024-10-31 22:19:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:19:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:19:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:19:21,962 INFO L87 Difference]: Start difference. First operand 308 states and 439 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:22,047 INFO L93 Difference]: Finished difference Result 322 states and 455 transitions. [2024-10-31 22:19:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:19:22,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2024-10-31 22:19:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:22,051 INFO L225 Difference]: With dead ends: 322 [2024-10-31 22:19:22,051 INFO L226 Difference]: Without dead ends: 320 [2024-10-31 22:19:22,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:19:22,056 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:22,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-31 22:19:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-10-31 22:19:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 295 states have (on average 1.3932203389830509) internal successors, (411), 297 states have internal predecessors, (411), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:19:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 451 transitions. [2024-10-31 22:19:22,090 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 451 transitions. Word has length 89 [2024-10-31 22:19:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:22,091 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 451 transitions. [2024-10-31 22:19:22,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 451 transitions. [2024-10-31 22:19:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-31 22:19:22,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:22,095 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:22,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:19:22,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:22,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash -510286070, now seen corresponding path program 1 times [2024-10-31 22:19:22,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:22,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042674458] [2024-10-31 22:19:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:22,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:22,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:22,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042674458] [2024-10-31 22:19:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042674458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:22,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:19:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537096884] [2024-10-31 22:19:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:22,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:19:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:22,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:19:22,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:19:22,917 INFO L87 Difference]: Start difference. First operand 320 states and 451 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:23,713 INFO L93 Difference]: Finished difference Result 1038 states and 1452 transitions. [2024-10-31 22:19:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:19:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2024-10-31 22:19:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:23,718 INFO L225 Difference]: With dead ends: 1038 [2024-10-31 22:19:23,719 INFO L226 Difference]: Without dead ends: 743 [2024-10-31 22:19:23,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:19:23,721 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 162 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:23,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 851 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:19:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-10-31 22:19:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 587. [2024-10-31 22:19:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 541 states have (on average 1.3974121996303142) internal successors, (756), 544 states have internal predecessors, (756), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-31 22:19:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 830 transitions. [2024-10-31 22:19:23,776 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 830 transitions. Word has length 89 [2024-10-31 22:19:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:23,776 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 830 transitions. [2024-10-31 22:19:23,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 830 transitions. [2024-10-31 22:19:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:19:23,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:23,778 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:23,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:19:23,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:23,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash -827246940, now seen corresponding path program 1 times [2024-10-31 22:19:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462479688] [2024-10-31 22:19:23,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462479688] [2024-10-31 22:19:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462479688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270258193] [2024-10-31 22:19:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:23,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:23,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:23,997 INFO L87 Difference]: Start difference. First operand 587 states and 830 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:24,501 INFO L93 Difference]: Finished difference Result 1344 states and 1878 transitions. [2024-10-31 22:19:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:19:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-10-31 22:19:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:24,506 INFO L225 Difference]: With dead ends: 1344 [2024-10-31 22:19:24,506 INFO L226 Difference]: Without dead ends: 782 [2024-10-31 22:19:24,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:19:24,508 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 218 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:24,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 483 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:19:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-31 22:19:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 664. [2024-10-31 22:19:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 618 states have (on average 1.383495145631068) internal successors, (855), 621 states have internal predecessors, (855), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-31 22:19:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 929 transitions. [2024-10-31 22:19:24,556 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 929 transitions. Word has length 90 [2024-10-31 22:19:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:24,557 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 929 transitions. [2024-10-31 22:19:24,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 929 transitions. [2024-10-31 22:19:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:19:24,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:24,559 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:24,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:19:24,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:24,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash -540215580, now seen corresponding path program 1 times [2024-10-31 22:19:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:24,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168420042] [2024-10-31 22:19:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:24,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:24,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168420042] [2024-10-31 22:19:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168420042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:24,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:24,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:19:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883817642] [2024-10-31 22:19:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:24,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:19:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:19:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:19:24,778 INFO L87 Difference]: Start difference. First operand 664 states and 929 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:24,879 INFO L93 Difference]: Finished difference Result 1327 states and 1851 transitions. [2024-10-31 22:19:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:19:24,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-10-31 22:19:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:24,883 INFO L225 Difference]: With dead ends: 1327 [2024-10-31 22:19:24,883 INFO L226 Difference]: Without dead ends: 688 [2024-10-31 22:19:24,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:19:24,885 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:24,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-10-31 22:19:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 676. [2024-10-31 22:19:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 630 states have (on average 1.3761904761904762) internal successors, (867), 633 states have internal predecessors, (867), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-31 22:19:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 941 transitions. [2024-10-31 22:19:24,953 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 941 transitions. Word has length 90 [2024-10-31 22:19:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:24,954 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 941 transitions. [2024-10-31 22:19:24,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 941 transitions. [2024-10-31 22:19:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:19:24,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:24,956 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:24,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:19:24,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:24,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1938045312, now seen corresponding path program 1 times [2024-10-31 22:19:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724765683] [2024-10-31 22:19:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:19:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:19:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:19:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:19:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:19:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:19:25,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:25,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724765683] [2024-10-31 22:19:25,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724765683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:25,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:25,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:25,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840274328] [2024-10-31 22:19:25,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:25,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:25,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:25,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:25,079 INFO L87 Difference]: Start difference. First operand 676 states and 941 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:25,143 INFO L93 Difference]: Finished difference Result 1335 states and 1861 transitions. [2024-10-31 22:19:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-10-31 22:19:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:25,148 INFO L225 Difference]: With dead ends: 1335 [2024-10-31 22:19:25,149 INFO L226 Difference]: Without dead ends: 684 [2024-10-31 22:19:25,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:25,151 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:25,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-10-31 22:19:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2024-10-31 22:19:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 638 states have (on average 1.371473354231975) internal successors, (875), 641 states have internal predecessors, (875), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-31 22:19:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 949 transitions. [2024-10-31 22:19:25,206 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 949 transitions. Word has length 90 [2024-10-31 22:19:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:25,206 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 949 transitions. [2024-10-31 22:19:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:19:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 949 transitions. [2024-10-31 22:19:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:19:25,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:25,208 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:25,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:19:25,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:25,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash 768574082, now seen corresponding path program 1 times [2024-10-31 22:19:25,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:25,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316500552] [2024-10-31 22:19:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 22:19:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956079274] [2024-10-31 22:19:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:25,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:19:25,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:25,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:19:25,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:19:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:25,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:19:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:25,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:19:25,789 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:19:25,790 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:19:25,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:19:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-31 22:19:25,996 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:26,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:19:26,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:19:26 BoogieIcfgContainer [2024-10-31 22:19:26,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:19:26,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:19:26,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:19:26,052 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:19:26,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:14" (3/4) ... [2024-10-31 22:19:26,056 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:19:26,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:19:26,058 INFO L158 Benchmark]: Toolchain (without parser) took 12879.51ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 135.2MB in the beginning and 129.5MB in the end (delta: 5.6MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2024-10-31 22:19:26,059 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 125.8MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:19:26,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.08ms. Allocated memory is still 174.1MB. Free memory was 134.7MB in the beginning and 118.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:19:26,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.66ms. Allocated memory is still 174.1MB. Free memory was 118.4MB in the beginning and 115.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:19:26,060 INFO L158 Benchmark]: Boogie Preprocessor took 110.97ms. Allocated memory is still 174.1MB. Free memory was 115.0MB in the beginning and 110.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:19:26,061 INFO L158 Benchmark]: RCFGBuilder took 854.97ms. Allocated memory is still 174.1MB. Free memory was 110.8MB in the beginning and 82.3MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-31 22:19:26,061 INFO L158 Benchmark]: TraceAbstraction took 11440.29ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 81.5MB in the beginning and 129.5MB in the end (delta: -48.0MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-10-31 22:19:26,062 INFO L158 Benchmark]: Witness Printer took 6.17ms. Allocated memory is still 251.7MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:19:26,063 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 125.8MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.08ms. Allocated memory is still 174.1MB. Free memory was 134.7MB in the beginning and 118.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.66ms. Allocated memory is still 174.1MB. Free memory was 118.4MB in the beginning and 115.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.97ms. Allocated memory is still 174.1MB. Free memory was 115.0MB in the beginning and 110.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 854.97ms. Allocated memory is still 174.1MB. Free memory was 110.8MB in the beginning and 82.3MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11440.29ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 81.5MB in the beginning and 129.5MB in the end (delta: -48.0MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 6.17ms. Allocated memory is still 251.7MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L45] unsigned char last_1_WrapperStruct0_var_1_7 = 0; [L46] signed short int last_1_WrapperStruct0_var_1_13 = 256; VAL [WrapperStruct0={4:0}, isInitial=0, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L90] EXPR WrapperStruct0.var_1_7 [L90] last_1_WrapperStruct0_var_1_7 = WrapperStruct0.var_1_7 [L91] EXPR WrapperStruct0.var_1_13 [L91] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L101] RET updateLastVariables() [L102] CALL updateVariables() [L75] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L76] EXPR WrapperStruct0.var_1_8 [L76] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L76] EXPR WrapperStruct0.var_1_8 [L76] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L77] WrapperStruct0.var_1_9 = __VERIFIER_nondet_double() [L78] EXPR WrapperStruct0.var_1_9 [L78] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F [L78] EXPR WrapperStruct0.var_1_9 [L78] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] CALL assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] RET assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L79] WrapperStruct0.var_1_10 = __VERIFIER_nondet_double() [L80] EXPR WrapperStruct0.var_1_10 [L80] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F [L80] EXPR WrapperStruct0.var_1_10 [L80] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] CALL assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] RET assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L81] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L82] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L82] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L83] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L84] WrapperStruct0.var_1_14 = __VERIFIER_nondet_float() [L85] EXPR WrapperStruct0.var_1_14 [L85] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F [L85] EXPR WrapperStruct0.var_1_14 [L85] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] CALL assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] RET assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L86] WrapperStruct0.var_1_15 = __VERIFIER_nondet_float() [L87] EXPR WrapperStruct0.var_1_15 [L87] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_15 [L87] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L102] RET updateVariables() [L103] CALL step() [L50] COND TRUE (last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L51] COND FALSE !(last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L59] WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L59] COND TRUE WrapperStruct0.var_1_12 [L60] EXPR WrapperStruct0.var_1_14 [L60] EXPR WrapperStruct0.var_1_15 [L60] EXPR WrapperStruct0.var_1_8 [L60] EXPR WrapperStruct0.var_1_10 [L60] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L60] COND FALSE !((WrapperStruct0.var_1_14 - WrapperStruct0.var_1_15) >= ((WrapperStruct0.var_1_8 + WrapperStruct0.var_1_10) + WrapperStruct0.var_1_9)) [L63] EXPR WrapperStruct0.var_1_1 [L63] WrapperStruct0.var_1_13 = WrapperStruct0.var_1_1 [L66] EXPR WrapperStruct0.var_1_8 [L66] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L66] EXPR ((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9) [L66] EXPR WrapperStruct0.var_1_8 [L66] EXPR ((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L66] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L66] COND TRUE ((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10 [L67] last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L67] last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L67] COND FALSE !(last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 [L94] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12))) [L94] EXPR WrapperStruct0.var_1_8 [L94] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR ((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9) [L94] EXPR WrapperStruct0.var_1_8 [L94] EXPR ((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)) [L94] EXPR WrapperStruct0.var_1_7 [L94] EXPR WrapperStruct0.var_1_12 [L94] EXPR (((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)))) && (WrapperStruct0.var_1_12 ? (((WrapperStruct0.var_1_14 - WrapperStruct0.var_1_15) >= ((WrapperStruct0.var_1_8 + WrapperStruct0.var_1_10) + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_13 == ((signed short int) ((((WrapperStruct0.var_1_1) > (WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_1) : (WrapperStruct0.var_1_1))))) : (WrapperStruct0.var_1_13 == ((signed short int) WrapperStruct0.var_1_1))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)))) && (WrapperStruct0.var_1_12 ? (((WrapperStruct0.var_1_14 - WrapperStruct0.var_1_15) >= ((WrapperStruct0.var_1_8 + WrapperStruct0.var_1_10) + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_13 == ((signed short int) ((((WrapperStruct0.var_1_1) > (WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_1) : (WrapperStruct0.var_1_1))))) : (WrapperStruct0.var_1_13 == ((signed short int) WrapperStruct0.var_1_1))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94-L95] return ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)))) && (WrapperStruct0.var_1_12 ? (((WrapperStruct0.var_1_14 - WrapperStruct0.var_1_15) >= ((WrapperStruct0.var_1_8 + WrapperStruct0.var_1_10) + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_13 == ((signed short int) ((((WrapperStruct0.var_1_1) > (WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_1) : (WrapperStruct0.var_1_1))))) : (WrapperStruct0.var_1_13 == ((signed short int) WrapperStruct0.var_1_1))) : 1) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 6244 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4934 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2136 IncrementalHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 1310 mSDtfsCounter, 2136 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=684occurred in iteration=10, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 581 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 856 ConstructedInterpolants, 0 QuantifiedInterpolants, 2518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 840/840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:19:26,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU --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 6d3c7b5e20b9cb5aff7067fd2169333c3619ec19d2be169214693b588a238e0b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:28,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:28,819 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:19:28,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:28,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:28,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:28,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:28,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:28,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:19:28,886 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:19:28,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:19:28,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:19:28,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:28,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:28,889 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:28,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:28,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:19:28,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:28,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:28,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:28,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:19:28,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:19:28,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:19:28,898 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:19:28,898 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:19:28,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:28,899 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:19:28,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:28,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:28,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:28,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:28,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:28,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:19:28,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:19:28,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:28,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:28,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:19:28,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:19:28,902 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:19:28,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:19:28,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:19:28,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:19:28,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:19:28,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:19:28,920 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:19:28,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 6d3c7b5e20b9cb5aff7067fd2169333c3619ec19d2be169214693b588a238e0b [2024-10-31 22:19:29,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:29,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:29,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:29,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:29,368 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:29,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i Unable to find full path for "g++" [2024-10-31 22:19:31,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:31,780 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:31,781 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i [2024-10-31 22:19:31,792 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/data/61ff25e18/e8c51b3f23b348739e016f387e58ac59/FLAG84362a19f [2024-10-31 22:19:31,814 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/data/61ff25e18/e8c51b3f23b348739e016f387e58ac59 [2024-10-31 22:19:31,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:31,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:31,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:31,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:31,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:31,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:31" (1/1) ... [2024-10-31 22:19:31,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f35383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:31, skipping insertion in model container [2024-10-31 22:19:31,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:31" (1/1) ... [2024-10-31 22:19:31,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:32,117 WARN L251 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_77269d7a-f55d-4817-94dc-94c4e3564fc6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i[916,929] [2024-10-31 22:19:32,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:32,208 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:32,225 WARN L251 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_77269d7a-f55d-4817-94dc-94c4e3564fc6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i[916,929] [2024-10-31 22:19:32,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:32,363 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:32,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32 WrapperNode [2024-10-31 22:19:32,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:32,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:32,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:32,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:32,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,479 INFO L138 Inliner]: procedures = 36, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 395 [2024-10-31 22:19:32,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:32,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:32,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:32,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:32,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,551 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-10-31 22:19:32,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:32,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:32,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:32,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:32,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:32" (1/1) ... [2024-10-31 22:19:32,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:32,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:32,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:32,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77269d7a-f55d-4817-94dc-94c4e3564fc6/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-31 22:19:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-31 22:19:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-31 22:19:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-31 22:19:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 22:19:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 22:19:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-31 22:19:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-31 22:19:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:19:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:19:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-31 22:19:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-31 22:19:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-31 22:19:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-31 22:19:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-31 22:19:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-31 22:19:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-31 22:19:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-31 22:19:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-31 22:19:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-31 22:19:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:19:32,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:19:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:32,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 22:19:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 22:19:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-31 22:19:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-31 22:19:32,898 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:32,901 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation