./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:35:13,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:35:13,635 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:35:13,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:35:13,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:35:13,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:35:13,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:35:13,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:35:13,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:35:13,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:35:13,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:35:13,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:35:13,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:35:13,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:35:13,696 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:35:13,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:35:13,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:35:13,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:35:13,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:35:13,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:35:13,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:35:13,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:35:13,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:35:13,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:35:13,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:35:13,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:35:13,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:35:13,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:35:13,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:35:13,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:35:13,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:35:13,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:35:13,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:35:13,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:35:13,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:35:13,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:35:13,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:35:13,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:35:13,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:35:13,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:35:13,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:35:13,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:35:13,709 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_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-08 18:35:13,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:35:14,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:35:14,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:35:14,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:35:14,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:35:14,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i Unable to find full path for "g++" [2024-11-08 18:35:16,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:35:16,239 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:35:16,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-08 18:35:16,252 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/data/ffb8bb9ef/a79aff993c7f4b5aaf49d2216d9aaf71/FLAG2d3f5fb76 [2024-11-08 18:35:16,278 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/data/ffb8bb9ef/a79aff993c7f4b5aaf49d2216d9aaf71 [2024-11-08 18:35:16,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:35:16,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:35:16,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:35:16,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:35:16,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:35:16,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337d7ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16, skipping insertion in model container [2024-11-08 18:35:16,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:35:16,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-08 18:35:16,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:35:16,617 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:35:16,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-08 18:35:16,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:35:16,709 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:35:16,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16 WrapperNode [2024-11-08 18:35:16,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:35:16,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:35:16,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:35:16,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:35:16,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,803 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2024-11-08 18:35:16,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:35:16,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:35:16,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:35:16,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:35:16,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,832 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 18:35:16,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:35:16,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:35:16,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:35:16,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:35:16,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (1/1) ... [2024-11-08 18:35:16,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:35:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:35:16,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:35:16,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:35:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:35:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 18:35:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 18:35:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 18:35:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 18:35:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 18:35:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 18:35:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:35:16,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:35:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 18:35:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:35:16,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:35:17,094 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:35:17,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:35:17,823 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-08 18:35:17,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:35:17,838 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:35:17,838 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:35:17,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:35:17 BoogieIcfgContainer [2024-11-08 18:35:17,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:35:17,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:35:17,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:35:17,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:35:17,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:35:16" (1/3) ... [2024-11-08 18:35:17,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a02232e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:35:17, skipping insertion in model container [2024-11-08 18:35:17,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:16" (2/3) ... [2024-11-08 18:35:17,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a02232e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:35:17, skipping insertion in model container [2024-11-08 18:35:17,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:35:17" (3/3) ... [2024-11-08 18:35:17,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-08 18:35:17,866 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:35:17,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:35:17,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:35:17,942 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;@3b9c9e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:35:17,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:35:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:35:17,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:17,959 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:17,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:17,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash -570375872, now seen corresponding path program 1 times [2024-11-08 18:35:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160269715] [2024-11-08 18:35:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:18,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160269715] [2024-11-08 18:35:18,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160269715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:18,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:35:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979805736] [2024-11-08 18:35:18,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:18,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:35:18,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:18,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:35:18,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:35:18,614 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 18:35:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:18,650 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-08 18:35:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:35:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-08 18:35:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:18,666 INFO L225 Difference]: With dead ends: 195 [2024-11-08 18:35:18,666 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 18:35:18,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:35:18,678 INFO L432 NwaCegarLoop]: 139 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, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:18,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:35:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 18:35:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 18:35:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-08 18:35:18,743 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-08 18:35:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:18,744 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-08 18:35:18,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 18:35:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-08 18:35:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:35:18,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:18,750 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:18,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:35:18,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:18,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1895750886, now seen corresponding path program 1 times [2024-11-08 18:35:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111170900] [2024-11-08 18:35:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111170900] [2024-11-08 18:35:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111170900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:35:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028369346] [2024-11-08 18:35:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:19,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:35:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:35:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:35:19,221 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:19,260 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-08 18:35:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:35:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:35:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:19,265 INFO L225 Difference]: With dead ends: 192 [2024-11-08 18:35:19,265 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 18:35:19,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:35:19,270 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:19,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:35:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 18:35:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 18:35:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-08 18:35:19,289 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-08 18:35:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:19,291 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-08 18:35:19,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-08 18:35:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:35:19,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:19,294 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:19,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:35:19,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:19,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash 593778076, now seen corresponding path program 1 times [2024-11-08 18:35:19,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:19,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943741081] [2024-11-08 18:35:19,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:19,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943741081] [2024-11-08 18:35:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943741081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:19,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:35:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412132839] [2024-11-08 18:35:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:19,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:35:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:35:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:35:19,598 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:19,636 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-08 18:35:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:35:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:35:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:19,639 INFO L225 Difference]: With dead ends: 194 [2024-11-08 18:35:19,639 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 18:35:19,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:35:19,642 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:19,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:35:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 18:35:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 18:35:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-08 18:35:19,658 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-08 18:35:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:19,659 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-08 18:35:19,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-08 18:35:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:35:19,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:19,662 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:19,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:35:19,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash -427290278, now seen corresponding path program 1 times [2024-11-08 18:35:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211256739] [2024-11-08 18:35:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211256739] [2024-11-08 18:35:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211256739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:20,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:35:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795079984] [2024-11-08 18:35:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:20,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:35:20,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:20,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:35:20,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:35:20,057 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:20,116 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-08 18:35:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:35:20,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:35:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:20,119 INFO L225 Difference]: With dead ends: 198 [2024-11-08 18:35:20,122 INFO L226 Difference]: Without dead ends: 102 [2024-11-08 18:35:20,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:35:20,124 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:20,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:35:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-08 18:35:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-08 18:35:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-08 18:35:20,142 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2024-11-08 18:35:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:20,143 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-08 18:35:20,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-08 18:35:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:35:20,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:20,149 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:20,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:35:20,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:20,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash 252768092, now seen corresponding path program 1 times [2024-11-08 18:35:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770747333] [2024-11-08 18:35:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:20,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770747333] [2024-11-08 18:35:20,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770747333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:20,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:20,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:35:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818501485] [2024-11-08 18:35:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:20,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:35:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:20,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:35:20,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:35:20,448 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:20,487 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-08 18:35:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:35:20,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:35:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:20,489 INFO L225 Difference]: With dead ends: 202 [2024-11-08 18:35:20,491 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 18:35:20,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:35:20,493 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:20,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:35:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 18:35:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-08 18:35:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-08 18:35:20,512 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-08 18:35:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:20,513 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-08 18:35:20,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-08 18:35:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:35:20,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:20,515 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:20,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:35:20,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:20,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2027775454, now seen corresponding path program 1 times [2024-11-08 18:35:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252406207] [2024-11-08 18:35:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:20,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:20,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252406207] [2024-11-08 18:35:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252406207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:20,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:20,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:35:20,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892267478] [2024-11-08 18:35:20,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:20,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:35:20,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:20,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:35:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:35:20,787 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:20,819 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-08 18:35:20,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:35:20,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:35:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:20,822 INFO L225 Difference]: With dead ends: 206 [2024-11-08 18:35:20,824 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 18:35:20,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:35:20,825 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:20,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:35:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 18:35:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-08 18:35:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-08 18:35:20,841 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-08 18:35:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:20,842 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-08 18:35:20,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-08 18:35:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:35:20,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:20,845 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:35:20,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2029622496, now seen corresponding path program 1 times [2024-11-08 18:35:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268250516] [2024-11-08 18:35:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268250516] [2024-11-08 18:35:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268250516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:21,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:35:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222222336] [2024-11-08 18:35:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:21,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:35:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:21,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:35:21,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:35:21,599 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:22,073 INFO L93 Difference]: Finished difference Result 259 states and 362 transitions. [2024-11-08 18:35:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:35:22,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:35:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:22,075 INFO L225 Difference]: With dead ends: 259 [2024-11-08 18:35:22,075 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 18:35:22,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:35:22,077 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:22,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 420 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:35:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 18:35:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 114. [2024-11-08 18:35:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-08 18:35:22,087 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 124 [2024-11-08 18:35:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:22,088 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-08 18:35:22,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-08 18:35:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 18:35:22,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:22,090 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:22,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:35:22,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:22,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:22,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1499236044, now seen corresponding path program 1 times [2024-11-08 18:35:22,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:22,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897681638] [2024-11-08 18:35:22,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897681638] [2024-11-08 18:35:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897681638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:23,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:23,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:35:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130558492] [2024-11-08 18:35:23,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:23,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:35:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:35:23,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:35:23,145 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:24,027 INFO L93 Difference]: Finished difference Result 281 states and 394 transitions. [2024-11-08 18:35:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:35:24,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 18:35:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:24,029 INFO L225 Difference]: With dead ends: 281 [2024-11-08 18:35:24,030 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 18:35:24,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:35:24,031 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 165 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 445 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.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:24,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 445 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:35:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 18:35:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2024-11-08 18:35:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 179 transitions. [2024-11-08 18:35:24,043 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 179 transitions. Word has length 125 [2024-11-08 18:35:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:24,044 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 179 transitions. [2024-11-08 18:35:24,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 179 transitions. [2024-11-08 18:35:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 18:35:24,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:24,046 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:24,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:35:24,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:24,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:24,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1633249550, now seen corresponding path program 1 times [2024-11-08 18:35:24,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:24,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029032356] [2024-11-08 18:35:24,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029032356] [2024-11-08 18:35:24,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029032356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:24,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:24,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:35:24,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192050380] [2024-11-08 18:35:24,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:24,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:35:24,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:24,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:35:24,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:35:24,486 INFO L87 Difference]: Start difference. First operand 127 states and 179 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:24,657 INFO L93 Difference]: Finished difference Result 253 states and 357 transitions. [2024-11-08 18:35:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:35:24,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 18:35:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:24,661 INFO L225 Difference]: With dead ends: 253 [2024-11-08 18:35:24,662 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 18:35:24,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:35:24,663 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:24,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:35:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 18:35:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2024-11-08 18:35:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 states have internal predecessors, (148), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2024-11-08 18:35:24,674 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 125 [2024-11-08 18:35:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:24,675 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2024-11-08 18:35:24,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2024-11-08 18:35:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 18:35:24,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:24,677 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:24,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:35:24,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1078351523, now seen corresponding path program 1 times [2024-11-08 18:35:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541385472] [2024-11-08 18:35:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:25,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:25,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541385472] [2024-11-08 18:35:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541385472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:25,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:25,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:35:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410121998] [2024-11-08 18:35:25,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:25,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:35:25,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:35:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:35:25,469 INFO L87 Difference]: Start difference. First operand 127 states and 178 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:25,960 INFO L93 Difference]: Finished difference Result 296 states and 414 transitions. [2024-11-08 18:35:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:35:25,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-08 18:35:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:25,962 INFO L225 Difference]: With dead ends: 296 [2024-11-08 18:35:25,962 INFO L226 Difference]: Without dead ends: 172 [2024-11-08 18:35:25,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:35:25,963 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 169 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:25,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 354 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:35:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-08 18:35:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2024-11-08 18:35:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 112 states have internal predecessors, (149), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2024-11-08 18:35:25,974 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 126 [2024-11-08 18:35:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:25,975 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2024-11-08 18:35:25,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2024-11-08 18:35:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 18:35:25,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:25,977 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:25,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:35:25,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1222471067, now seen corresponding path program 1 times [2024-11-08 18:35:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191038970] [2024-11-08 18:35:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:26,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:26,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191038970] [2024-11-08 18:35:26,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191038970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:26,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:35:26,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36335785] [2024-11-08 18:35:26,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:26,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:35:26,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:26,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:35:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:35:26,401 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:26,628 INFO L93 Difference]: Finished difference Result 295 states and 408 transitions. [2024-11-08 18:35:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:35:26,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-08 18:35:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:26,631 INFO L225 Difference]: With dead ends: 295 [2024-11-08 18:35:26,631 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 18:35:26,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:35:26,632 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:26,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 390 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:35:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 18:35:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 130. [2024-11-08 18:35:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 180 transitions. [2024-11-08 18:35:26,642 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 180 transitions. Word has length 126 [2024-11-08 18:35:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:26,643 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 180 transitions. [2024-11-08 18:35:26,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2024-11-08 18:35:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 18:35:26,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:26,645 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:26,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:35:26,646 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 466525191, now seen corresponding path program 1 times [2024-11-08 18:35:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:26,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229792628] [2024-11-08 18:35:26,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:26,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:27,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:27,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229792628] [2024-11-08 18:35:27,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229792628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:27,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:27,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:35:27,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171350951] [2024-11-08 18:35:27,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:27,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:35:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:27,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:35:27,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:35:27,535 INFO L87 Difference]: Start difference. First operand 130 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:28,005 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2024-11-08 18:35:28,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:35:28,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-08 18:35:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:28,008 INFO L225 Difference]: With dead ends: 306 [2024-11-08 18:35:28,008 INFO L226 Difference]: Without dead ends: 179 [2024-11-08 18:35:28,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:35:28,010 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 206 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:28,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 425 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:35:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-08 18:35:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2024-11-08 18:35:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2024-11-08 18:35:28,023 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 126 [2024-11-08 18:35:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:28,023 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2024-11-08 18:35:28,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2024-11-08 18:35:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 18:35:28,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:28,026 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:28,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:35:28,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:28,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash 712755377, now seen corresponding path program 1 times [2024-11-08 18:35:28,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:28,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039362709] [2024-11-08 18:35:28,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:28,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:29,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:29,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039362709] [2024-11-08 18:35:29,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039362709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:29,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:29,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:35:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927731499] [2024-11-08 18:35:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:29,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:35:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:35:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:35:29,643 INFO L87 Difference]: Start difference. First operand 134 states and 186 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:30,423 INFO L93 Difference]: Finished difference Result 317 states and 438 transitions. [2024-11-08 18:35:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:35:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-08 18:35:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:30,426 INFO L225 Difference]: With dead ends: 317 [2024-11-08 18:35:30,426 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 18:35:30,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:35:30,427 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 152 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:30,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 607 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:35:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 18:35:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 143. [2024-11-08 18:35:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 126 states have (on average 1.3333333333333333) internal successors, (168), 126 states have internal predecessors, (168), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 198 transitions. [2024-11-08 18:35:30,449 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 198 transitions. Word has length 127 [2024-11-08 18:35:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:30,450 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 198 transitions. [2024-11-08 18:35:30,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 198 transitions. [2024-11-08 18:35:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 18:35:30,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:30,453 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:30,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:35:30,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:30,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2037335205, now seen corresponding path program 1 times [2024-11-08 18:35:30,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:30,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433265013] [2024-11-08 18:35:30,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:31,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433265013] [2024-11-08 18:35:31,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433265013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:31,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:35:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367583204] [2024-11-08 18:35:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:35:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:35:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:35:31,432 INFO L87 Difference]: Start difference. First operand 143 states and 198 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:32,279 INFO L93 Difference]: Finished difference Result 330 states and 455 transitions. [2024-11-08 18:35:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:35:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-08 18:35:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:32,282 INFO L225 Difference]: With dead ends: 330 [2024-11-08 18:35:32,283 INFO L226 Difference]: Without dead ends: 190 [2024-11-08 18:35:32,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:35:32,284 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 171 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:32,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 438 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:35:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-08 18:35:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 145. [2024-11-08 18:35:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.3359375) internal successors, (171), 128 states have internal predecessors, (171), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2024-11-08 18:35:32,314 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 127 [2024-11-08 18:35:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:32,315 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2024-11-08 18:35:32,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2024-11-08 18:35:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 18:35:32,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:32,317 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:32,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:35:32,317 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:32,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 53712783, now seen corresponding path program 1 times [2024-11-08 18:35:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:32,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565090757] [2024-11-08 18:35:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:32,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565090757] [2024-11-08 18:35:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565090757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:32,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:32,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:35:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877673168] [2024-11-08 18:35:32,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:32,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:35:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:35:32,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:35:32,572 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:32,609 INFO L93 Difference]: Finished difference Result 290 states and 403 transitions. [2024-11-08 18:35:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:35:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-08 18:35:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:32,611 INFO L225 Difference]: With dead ends: 290 [2024-11-08 18:35:32,612 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 18:35:32,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:35:32,615 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:32,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:35:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 18:35:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-08 18:35:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 states have internal predecessors, (174), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 204 transitions. [2024-11-08 18:35:32,629 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 204 transitions. Word has length 128 [2024-11-08 18:35:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:32,630 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 204 transitions. [2024-11-08 18:35:32,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 204 transitions. [2024-11-08 18:35:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 18:35:32,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:32,633 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:32,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:35:32,633 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:32,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:32,634 INFO L85 PathProgramCache]: Analyzing trace with hash 23691972, now seen corresponding path program 1 times [2024-11-08 18:35:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:32,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869771929] [2024-11-08 18:35:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:32,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:33,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:33,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869771929] [2024-11-08 18:35:33,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869771929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:33,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:33,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:35:33,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124077818] [2024-11-08 18:35:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:33,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:35:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:35:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:35:33,555 INFO L87 Difference]: Start difference. First operand 148 states and 204 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:34,048 INFO L93 Difference]: Finished difference Result 337 states and 461 transitions. [2024-11-08 18:35:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:35:34,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-08 18:35:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:34,052 INFO L225 Difference]: With dead ends: 337 [2024-11-08 18:35:34,053 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 18:35:34,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:35:34,054 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 286 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:34,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 300 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:35:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 18:35:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 144. [2024-11-08 18:35:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 127 states have internal predecessors, (168), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2024-11-08 18:35:34,088 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 128 [2024-11-08 18:35:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:34,089 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2024-11-08 18:35:34,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2024-11-08 18:35:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 18:35:34,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:34,092 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:34,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:35:34,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:34,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1004462824, now seen corresponding path program 1 times [2024-11-08 18:35:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:34,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725157811] [2024-11-08 18:35:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:35:36,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:36,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725157811] [2024-11-08 18:35:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725157811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:35:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319777673] [2024-11-08 18:35:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:36,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:35:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:35:36,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:35:36,597 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:37,895 INFO L93 Difference]: Finished difference Result 338 states and 461 transitions. [2024-11-08 18:35:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:35:37,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-08 18:35:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:37,898 INFO L225 Difference]: With dead ends: 338 [2024-11-08 18:35:37,899 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 18:35:37,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:35:37,900 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 154 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:37,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 688 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:35:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 18:35:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2024-11-08 18:35:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.3255813953488371) internal successors, (171), 129 states have internal predecessors, (171), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:35:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 201 transitions. [2024-11-08 18:35:37,915 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 201 transitions. Word has length 129 [2024-11-08 18:35:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:37,915 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 201 transitions. [2024-11-08 18:35:37,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:35:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 201 transitions. [2024-11-08 18:35:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 18:35:37,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:37,918 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:37,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:35:37,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:37,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:37,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1698063722, now seen corresponding path program 1 times [2024-11-08 18:35:37,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:37,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757827996] [2024-11-08 18:35:37,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:37,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:35:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:35:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:35:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:35:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:35:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:35:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:35:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:35:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:35:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:35:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:35:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:35:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:35:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 18:35:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 18:35:39,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:39,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757827996] [2024-11-08 18:35:39,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757827996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:35:39,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523806013] [2024-11-08 18:35:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:39,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:35:39,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:35:39,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:35:39,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:35:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:40,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 18:35:40,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:35:43,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:35:44,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 18:35:44,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 18:35:45,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:35:45,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-08 18:35:45,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:35:45,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 308 [2024-11-08 18:35:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 153 proven. 65 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-08 18:35:45,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:35:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523806013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:35:48,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:35:48,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-08 18:35:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821183337] [2024-11-08 18:35:48,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:35:48,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:35:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:48,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:35:48,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:35:48,042 INFO L87 Difference]: Start difference. First operand 146 states and 201 transitions. Second operand has 18 states, 15 states have (on average 6.533333333333333) internal successors, (98), 18 states have internal predecessors, (98), 9 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-08 18:35:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:50,110 INFO L93 Difference]: Finished difference Result 329 states and 453 transitions. [2024-11-08 18:35:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:35:50,111 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 6.533333333333333) internal successors, (98), 18 states have internal predecessors, (98), 9 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 9 states have call successors, (30) Word has length 129 [2024-11-08 18:35:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:50,113 INFO L225 Difference]: With dead ends: 329 [2024-11-08 18:35:50,113 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 18:35:50,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2024-11-08 18:35:50,114 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 286 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:50,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 454 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 18:35:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 18:35:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2024-11-08 18:35:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 145 states have (on average 1.289655172413793) internal successors, (187), 146 states have internal predecessors, (187), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 18:35:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 237 transitions. [2024-11-08 18:35:50,141 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 237 transitions. Word has length 129 [2024-11-08 18:35:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:50,141 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 237 transitions. [2024-11-08 18:35:50,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 6.533333333333333) internal successors, (98), 18 states have internal predecessors, (98), 9 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-08 18:35:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 237 transitions. [2024-11-08 18:35:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 18:35:50,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:50,144 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:50,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:35:50,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 18:35:50,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:50,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1720695976, now seen corresponding path program 1 times [2024-11-08 18:35:50,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:50,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641650670] [2024-11-08 18:35:50,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:50,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:35:50,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:35:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:35:50,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:35:50,807 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:35:50,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:35:50,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:35:50,815 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:50,977 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:35:50,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:35:50 BoogieIcfgContainer [2024-11-08 18:35:50,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:35:50,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:35:50,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:35:50,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:35:50,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:35:17" (3/4) ... [2024-11-08 18:35:50,985 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:35:50,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:35:50,987 INFO L158 Benchmark]: Toolchain (without parser) took 34704.18ms. Allocated memory was 130.0MB in the beginning and 645.9MB in the end (delta: 515.9MB). Free memory was 75.6MB in the beginning and 570.3MB in the end (delta: -494.7MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-08 18:35:50,987 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory was 97.8MB in the beginning and 97.7MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:35:50,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.01ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 75.6MB in the beginning and 142.6MB in the end (delta: -67.0MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-08 18:35:50,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.41ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 139.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:35:50,988 INFO L158 Benchmark]: Boogie Preprocessor took 58.24ms. Allocated memory is still 174.1MB. Free memory was 139.2MB in the beginning and 135.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:35:50,989 INFO L158 Benchmark]: RCFGBuilder took 975.42ms. Allocated memory is still 174.1MB. Free memory was 135.5MB in the beginning and 101.5MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-08 18:35:50,989 INFO L158 Benchmark]: TraceAbstraction took 33139.98ms. Allocated memory was 174.1MB in the beginning and 645.9MB in the end (delta: 471.9MB). Free memory was 100.7MB in the beginning and 571.4MB in the end (delta: -470.7MB). Peak memory consumption was 346.9MB. Max. memory is 16.1GB. [2024-11-08 18:35:50,989 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 645.9MB. Free memory is still 570.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:35:50,991 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.28ms. Allocated memory is still 130.0MB. Free memory was 97.8MB in the beginning and 97.7MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.01ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 75.6MB in the beginning and 142.6MB in the end (delta: -67.0MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.41ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 139.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.24ms. Allocated memory is still 174.1MB. Free memory was 139.2MB in the beginning and 135.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 975.42ms. Allocated memory is still 174.1MB. Free memory was 135.5MB in the beginning and 101.5MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33139.98ms. Allocated memory was 174.1MB in the beginning and 645.9MB in the end (delta: 471.9MB). Free memory was 100.7MB in the beginning and 571.4MB in the end (delta: -470.7MB). Peak memory consumption was 346.9MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 645.9MB. Free memory is still 570.3MB. 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 someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryArithmeticDOUBLEoperation at line 89. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 0, 16, 4, 0, 0, 55182, 0, 1, 1, 100, 2.25, 199.4, -128 }; [L55] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] signed char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L100] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L103] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L106] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L115] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L72] COND FALSE !(! (*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L75] (*(WrapperStruct00_var_1_12_Pointer)) = ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L77] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L78] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L80] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L81] COND FALSE !((*(WrapperStruct00_var_1_12_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] (*(WrapperStruct00_var_1_1_Pointer)) = (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))))) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] COND FALSE !(((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121-L122] return (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.9s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1870 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1858 mSDsluCounter, 7267 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4924 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3783 IncrementalHoareTripleChecker+Invalid, 3832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 2343 mSDtfsCounter, 3783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 855 GetRequests, 740 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=18, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 418 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 2522 NumberOfCodeBlocks, 2522 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2374 ConstructedInterpolants, 0 QuantifiedInterpolants, 14930 SizeOfPredicates, 18 NumberOfNonLiveVariables, 533 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 7903/7980 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:35:51,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:35:53,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:35:53,645 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:35:53,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:35:53,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:35:53,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:35:53,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:35:53,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:35:53,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:35:53,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:35:53,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:35:53,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:35:53,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:35:53,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:35:53,705 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:35:53,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:35:53,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:35:53,706 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:35:53,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:35:53,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:35:53,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:35:53,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:35:53,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:35:53,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:35:53,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:35:53,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:35:53,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:35:53,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:35:53,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:35:53,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:35:53,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:35:53,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:35:53,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:35:53,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:35:53,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:35:53,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:35:53,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:35:53,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:35:53,718 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:35:53,727 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:35:53,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:35:53,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:35:53,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:35:53,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:35:53,729 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_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-08 18:35:54,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:35:54,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:35:54,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:35:54,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:35:54,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:35:54,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i Unable to find full path for "g++" [2024-11-08 18:35:56,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:35:56,669 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:35:56,669 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-08 18:35:56,684 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/data/ee11de57d/57905d509d3246fdb09935526706dedb/FLAGdfbd08815 [2024-11-08 18:35:56,711 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/data/ee11de57d/57905d509d3246fdb09935526706dedb [2024-11-08 18:35:56,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:35:56,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:35:56,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:35:56,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:35:56,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:35:56,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55778596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56, skipping insertion in model container [2024-11-08 18:35:56,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:35:57,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-08 18:35:57,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:35:57,172 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:35:57,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-08 18:35:57,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:35:57,330 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:35:57,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57 WrapperNode [2024-11-08 18:35:57,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:35:57,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:35:57,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:35:57,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:35:57,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,400 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2024-11-08 18:35:57,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:35:57,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:35:57,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:35:57,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:35:57,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,460 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-08 18:35:57,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:35:57,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:35:57,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:35:57,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:35:57,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (1/1) ... [2024-11-08 18:35:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:35:57,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:35:57,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:35:57,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:35:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:35:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 18:35:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 18:35:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:35:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:35:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 18:35:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 18:35:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 18:35:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 18:35:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 18:35:57,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 18:35:57,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 18:35:57,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 18:35:57,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 18:35:57,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 18:35:57,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:35:57,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:35:57,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 18:35:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 18:35:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:35:57,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:35:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 18:35:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 18:35:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 18:35:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 18:35:57,824 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:35:57,826 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:36:16,508 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-08 18:36:16,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:36:16,523 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:36:16,523 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:36:16,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:16 BoogieIcfgContainer [2024-11-08 18:36:16,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:36:16,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:36:16,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:36:16,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:36:16,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:35:56" (1/3) ... [2024-11-08 18:36:16,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e475b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:36:16, skipping insertion in model container [2024-11-08 18:36:16,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:57" (2/3) ... [2024-11-08 18:36:16,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e475b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:36:16, skipping insertion in model container [2024-11-08 18:36:16,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:16" (3/3) ... [2024-11-08 18:36:16,532 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-08 18:36:16,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:36:16,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:36:16,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:36:16,654 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;@62142b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:36:16,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:36:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:36:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:36:16,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:16,673 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:16,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:16,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 939651999, now seen corresponding path program 1 times [2024-11-08 18:36:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893351546] [2024-11-08 18:36:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:16,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:16,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:16,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:36:16,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 18:36:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:18,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:36:18,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-08 18:36:18,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:18,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:18,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893351546] [2024-11-08 18:36:18,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893351546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:18,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:18,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:36:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702763307] [2024-11-08 18:36:18,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:18,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:36:18,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:18,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:36:18,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:36:18,136 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 18:36:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:18,178 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-08 18:36:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:36:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-08 18:36:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:18,189 INFO L225 Difference]: With dead ends: 195 [2024-11-08 18:36:18,189 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 18:36:18,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:36:18,196 INFO L432 NwaCegarLoop]: 139 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, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:18,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:36:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 18:36:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 18:36:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:36:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-08 18:36:18,239 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-08 18:36:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-08 18:36:18,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 18:36:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-08 18:36:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:36:18,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:18,246 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:18,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:18,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:18,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash -385723015, now seen corresponding path program 1 times [2024-11-08 18:36:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390007719] [2024-11-08 18:36:18,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:18,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:18,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:18,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:36:18,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 18:36:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:19,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:36:19,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:36:20,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:20,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:20,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390007719] [2024-11-08 18:36:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390007719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:20,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:20,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:36:20,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844620950] [2024-11-08 18:36:20,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:20,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:36:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:36:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:36:20,029 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:20,211 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-08 18:36:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:36:20,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:36:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:20,215 INFO L225 Difference]: With dead ends: 192 [2024-11-08 18:36:20,215 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 18:36:20,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:36:20,218 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:20,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:36:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 18:36:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 18:36:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:36:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-08 18:36:20,233 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-08 18:36:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:20,235 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-08 18:36:20,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-08 18:36:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:36:20,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:20,240 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:20,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 18:36:20,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:20,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:20,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2103805947, now seen corresponding path program 1 times [2024-11-08 18:36:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447081232] [2024-11-08 18:36:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:20,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:20,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:20,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:36:20,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 18:36:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:21,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:36:21,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:36:21,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:21,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447081232] [2024-11-08 18:36:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447081232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:21,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:21,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:36:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387887370] [2024-11-08 18:36:21,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:21,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:36:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:36:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:36:21,896 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:22,062 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-08 18:36:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:36:22,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:36:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:22,065 INFO L225 Difference]: With dead ends: 194 [2024-11-08 18:36:22,065 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 18:36:22,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:36:22,067 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:22,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:36:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 18:36:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 18:36:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:36:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-08 18:36:22,080 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-08 18:36:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:22,081 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-08 18:36:22,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-08 18:36:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:36:22,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:22,084 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:22,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:22,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:22,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:22,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1082737593, now seen corresponding path program 1 times [2024-11-08 18:36:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113097553] [2024-11-08 18:36:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:22,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:36:22,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 18:36:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:23,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:36:23,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:36:24,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:24,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:24,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113097553] [2024-11-08 18:36:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113097553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:24,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:36:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263761643] [2024-11-08 18:36:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:24,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:36:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:24,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:36:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:36:24,104 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:24,710 INFO L93 Difference]: Finished difference Result 200 states and 286 transitions. [2024-11-08 18:36:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:36:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:36:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:24,717 INFO L225 Difference]: With dead ends: 200 [2024-11-08 18:36:24,717 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 18:36:24,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:36:24,720 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:24,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:36:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 18:36:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-08 18:36:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:36:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-08 18:36:24,732 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-08 18:36:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:24,733 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-08 18:36:24,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-08 18:36:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:36:24,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:24,736 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:24,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 18:36:24,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:24,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:24,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:24,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1762795963, now seen corresponding path program 1 times [2024-11-08 18:36:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:24,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804065022] [2024-11-08 18:36:24,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:24,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:24,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:24,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:36:24,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 18:36:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:26,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:36:26,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:36:26,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:26,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:26,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804065022] [2024-11-08 18:36:26,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804065022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:26,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:26,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:36:26,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170985202] [2024-11-08 18:36:26,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:26,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:36:26,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:36:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:36:26,763 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:27,514 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-08 18:36:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:36:27,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:36:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:27,523 INFO L225 Difference]: With dead ends: 206 [2024-11-08 18:36:27,523 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 18:36:27,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:36:27,528 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:27,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:36:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 18:36:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-08 18:36:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:36:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-08 18:36:27,548 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-08 18:36:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:27,548 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-08 18:36:27,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-08 18:36:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:36:27,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:27,551 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:27,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:27,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:27,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:27,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash -757163971, now seen corresponding path program 1 times [2024-11-08 18:36:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261329262] [2024-11-08 18:36:27,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:27,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:27,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:27,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:36:27,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 18:36:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:29,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:36:29,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:36:29,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:29,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:29,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261329262] [2024-11-08 18:36:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261329262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:29,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:29,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:36:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617628096] [2024-11-08 18:36:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:29,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:36:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:29,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:36:29,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:36:29,925 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:30,900 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-08 18:36:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:36:30,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:36:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:30,903 INFO L225 Difference]: With dead ends: 210 [2024-11-08 18:36:30,904 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 18:36:30,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:36:30,906 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:30,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:36:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 18:36:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-08 18:36:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:36:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-08 18:36:30,918 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-08 18:36:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:30,918 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-08 18:36:30,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:36:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-08 18:36:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:36:30,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:30,921 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:30,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 18:36:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:31,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash -755316929, now seen corresponding path program 1 times [2024-11-08 18:36:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012205766] [2024-11-08 18:36:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:36:31,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:31,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:36:31,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 18:36:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:33,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 18:36:33,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:44,799 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:36:49,889 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:36:58,211 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:37:02,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-08 18:37:06,344 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-08 18:37:17,730 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:37:25,964 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:37:34,288 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:37:38,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (= .cse1 |c_ULTIMATE.start_step_#t~mem35#1|) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2024-11-08 18:37:49,118 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:37:57,292 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:38:05,601 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:38:09,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-08 18:38:13,725 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-08 18:38:21,828 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:38:29,977 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:38:38,284 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:38:38,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 84 [2024-11-08 18:38:49,429 WARN L286 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:38:57,273 WARN L286 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:39:05,428 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:39:17,660 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:39:24,500 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 14 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:39:29,327 WARN L851 $PredicateComparison]: unable to prove that (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1))))))) is different from false [2024-11-08 18:39:33,375 WARN L873 $PredicateComparison]: unable to prove that (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1))))))) is different from true [2024-11-08 18:39:45,545 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:39:53,735 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:39:57,777 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)))))) is different from false [2024-11-08 18:40:01,812 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)))))) is different from true [2024-11-08 18:40:13,288 WARN L286 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:40:21,461 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:40:33,606 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:40:41,764 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:40:51,174 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:40:59,342 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:41:11,538 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:41:19,728 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:41:31,895 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:41:39,789 WARN L286 SmtUtils]: Spent 7.89s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:41:50,601 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:41:58,762 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:42:10,994 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:42:19,150 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:42:31,312 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:42:39,501 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:42:50,837 WARN L286 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:42:59,052 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:43:09,999 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:43:18,171 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:43:30,085 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:43:38,268 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:43:50,441 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:43:58,607 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:44:10,826 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:44:19,017 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:44:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:44:19,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:44:19,019 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:44:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012205766] [2024-11-08 18:44:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012205766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:44:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331266453] [2024-11-08 18:44:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:19,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:44:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:44:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:44:19,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=7, Unknown=9, NotChecked=40, Total=72 [2024-11-08 18:44:19,023 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:44:25,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:44:29,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:44:34,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:44:38,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:44:43,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:44:47,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:44:51,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:44:55,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:00,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:04,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:08,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:12,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:18,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:22,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:27,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:31,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:45:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:45:31,971 INFO L93 Difference]: Finished difference Result 231 states and 319 transitions. [2024-11-08 18:45:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:45:31,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-08 18:45:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:45:31,980 INFO L225 Difference]: With dead ends: 231 [2024-11-08 18:45:31,980 INFO L226 Difference]: Without dead ends: 229 [2024-11-08 18:45:31,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=16, Invalid=7, Unknown=9, NotChecked=40, Total=72 [2024-11-08 18:45:31,982 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 77 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 1475 IncrementalHoareTripleChecker+Unchecked, 72.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:45:31,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 391 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 16 Unknown, 1475 Unchecked, 72.9s Time] [2024-11-08 18:45:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-08 18:45:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2024-11-08 18:45:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 194 states have internal predecessors, (256), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 18:45:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 316 transitions. [2024-11-08 18:45:32,009 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 316 transitions. Word has length 124 [2024-11-08 18:45:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:45:32,009 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 316 transitions. [2024-11-08 18:45:32,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:45:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 316 transitions. [2024-11-08 18:45:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:45:32,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:45:32,013 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:45:32,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-08 18:45:32,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:45:32,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:45:32,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:45:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1572965379, now seen corresponding path program 1 times [2024-11-08 18:45:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:45:32,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173123663] [2024-11-08 18:45:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:45:32,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:45:32,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:45:32,217 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:45:32,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 18:45:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:45:36,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 18:45:36,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:46:04,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:46:14,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-08 18:46:21,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-08 18:46:26,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-11-08 18:46:29,120 INFO L349 Elim1Store]: treesize reduction 116, result has 20.0 percent of original size [2024-11-08 18:46:29,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 79 [2024-11-08 18:46:29,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:46:29,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 113 [2024-11-08 18:46:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 158 proven. 68 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-08 18:46:30,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:46:45,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:46:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173123663] [2024-11-08 18:46:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173123663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:46:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439910645] [2024-11-08 18:46:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:46:45,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:46:45,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:46:45,948 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:46:45,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4566c54-205f-46e5-9f70-261f3568f6ca/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:46:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:46:47,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 18:46:47,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:11,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 18:47:26,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-08 18:47:33,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-08 18:47:39,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2024-11-08 18:47:42,164 INFO L349 Elim1Store]: treesize reduction 116, result has 20.0 percent of original size [2024-11-08 18:47:42,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 74 [2024-11-08 18:47:42,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:47:42,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 108 [2024-11-08 18:47:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 68 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 18:47:43,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:43,578 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (_ BitVec 32)) (v_ArrVal_404 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32)) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (let ((.cse0 (store (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_405) c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset))))) c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_404)))) (store .cse0 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_408))) c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset)) (_ bv0 8)))) is different from false [2024-11-08 18:47:43,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (_ BitVec 32)) (v_ArrVal_404 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32)) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset))))))) (store (store .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_405) c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select (store .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset))))) c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_404))))) (store .cse0 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_408))) c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset))))) is different from false [2024-11-08 18:47:44,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439910645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:47:44,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:47:44,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2024-11-08 18:47:44,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981793891] [2024-11-08 18:47:44,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:47:44,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 18:47:44,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:44,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 18:47:44,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=674, Unknown=5, NotChecked=110, Total=930 [2024-11-08 18:47:44,113 INFO L87 Difference]: Start difference. First operand 227 states and 316 transitions. Second operand has 27 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 21 states have internal predecessors, (88), 9 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2024-11-08 18:48:10,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:14,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:18,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:22,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:26,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:30,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:34,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:38,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:42,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:46,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:50,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:54,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:58,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:02,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:03,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:10,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:15,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:19,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:23,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:27,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:31,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:35,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:39,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:43,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:47,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:51,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:55,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:59,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]