./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 a6e01815b85081eba7e0081229a01ecf7f6dda700f05238454388a259fe464fd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:36,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:36,818 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:53:36,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:36,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:36,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:36,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:36,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:36,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:36,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:36,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:36,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:36,885 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:36,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:36,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:36,888 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:36,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:36,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:36,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:36,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:36,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:36,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:36,891 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:36,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:36,892 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:36,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:36,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:36,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:36,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:36,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:36,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:36,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:36,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:36,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:36,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:36,898 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:36,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:36,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:36,899 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:36,899 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_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/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_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a6e01815b85081eba7e0081229a01ecf7f6dda700f05238454388a259fe464fd [2023-11-06 21:53:37,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:37,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:37,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:37,251 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:37,252 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:37,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i [2023-11-06 21:53:40,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:40,728 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:40,729 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i [2023-11-06 21:53:40,739 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/data/174007ac9/25631e23ac27428e940eec4a561a97f3/FLAGe988eaf79 [2023-11-06 21:53:40,755 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/data/174007ac9/25631e23ac27428e940eec4a561a97f3 [2023-11-06 21:53:40,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:40,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:40,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:40,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:40,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:40,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:40,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1ad0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40, skipping insertion in model container [2023-11-06 21:53:40,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:40,806 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:40,950 WARN L240 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_1bd0966c-229a-4862-99c3-701c0d8e0de4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i[913,926] [2023-11-06 21:53:41,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:41,025 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:41,038 WARN L240 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_1bd0966c-229a-4862-99c3-701c0d8e0de4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i[913,926] [2023-11-06 21:53:41,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:41,095 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:41,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41 WrapperNode [2023-11-06 21:53:41,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:41,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:41,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:41,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:41,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,166 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2023-11-06 21:53:41,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:41,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:41,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:41,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:41,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:41,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:41,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:41,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:41,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (1/1) ... [2023-11-06 21:53:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:41,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:41,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:41,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:41,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:41,518 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:41,520 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:41,911 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:41,918 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:41,919 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:53:41,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:41 BoogieIcfgContainer [2023-11-06 21:53:41,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:41,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:41,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:41,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:41,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:40" (1/3) ... [2023-11-06 21:53:41,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564119e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:41, skipping insertion in model container [2023-11-06 21:53:41,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:41" (2/3) ... [2023-11-06 21:53:41,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564119e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:41, skipping insertion in model container [2023-11-06 21:53:41,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:41" (3/3) ... [2023-11-06 21:53:41,935 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-29.i [2023-11-06 21:53:41,954 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:41,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:53:42,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:42,039 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2b0863ad, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:42,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:53:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:53:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-06 21:53:42,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:42,067 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:42,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:42,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash 731389584, now seen corresponding path program 1 times [2023-11-06 21:53:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:42,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929226309] [2023-11-06 21:53:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:42,299 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:53:42,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654778496] [2023-11-06 21:53:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:42,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:42,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:42,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:53:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:42,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:53:42,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-11-06 21:53:43,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-11-06 21:53:43,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:43,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929226309] [2023-11-06 21:53:43,305 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:53:43,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654778496] [2023-11-06 21:53:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654778496] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:53:43,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:53:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-06 21:53:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954634952] [2023-11-06 21:53:43,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:43,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:53:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:53:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:53:43,351 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2023-11-06 21:53:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:43,726 INFO L93 Difference]: Finished difference Result 143 states and 253 transitions. [2023-11-06 21:53:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:53:43,729 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) Word has length 170 [2023-11-06 21:53:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:43,740 INFO L225 Difference]: With dead ends: 143 [2023-11-06 21:53:43,754 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 21:53:43,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:53:43,762 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:43,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 141 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 21:53:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2023-11-06 21:53:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:53:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2023-11-06 21:53:43,871 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 170 [2023-11-06 21:53:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:43,874 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2023-11-06 21:53:43,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2023-11-06 21:53:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2023-11-06 21:53:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-06 21:53:43,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:43,880 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:43,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:44,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-06 21:53:44,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:44,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash 101034423, now seen corresponding path program 1 times [2023-11-06 21:53:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:44,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459997519] [2023-11-06 21:53:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:44,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:44,210 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:53:44,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558688208] [2023-11-06 21:53:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:44,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:44,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:44,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:44,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:53:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:53:44,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2023-11-06 21:53:45,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:53:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:45,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459997519] [2023-11-06 21:53:45,417 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:53:45,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558688208] [2023-11-06 21:53:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558688208] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:45,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:53:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2023-11-06 21:53:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790584589] [2023-11-06 21:53:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:45,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:45,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:45,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:45,421 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:53:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:45,466 INFO L93 Difference]: Finished difference Result 210 states and 315 transitions. [2023-11-06 21:53:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2023-11-06 21:53:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:45,472 INFO L225 Difference]: With dead ends: 210 [2023-11-06 21:53:45,472 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 21:53:45,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:45,475 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:45,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 21:53:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2023-11-06 21:53:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 21:53:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 209 transitions. [2023-11-06 21:53:45,522 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 209 transitions. Word has length 171 [2023-11-06 21:53:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:45,523 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 209 transitions. [2023-11-06 21:53:45,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:53:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 209 transitions. [2023-11-06 21:53:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-06 21:53:45,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:45,528 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:45,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:45,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-06 21:53:45,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:45,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash 158292725, now seen corresponding path program 1 times [2023-11-06 21:53:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:45,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905705044] [2023-11-06 21:53:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:45,792 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:53:45,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380698200] [2023-11-06 21:53:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:45,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:45,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:45,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:45,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:53:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:45,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:46,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:46,142 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:53:46,143 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:53:46,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:46,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-06 21:53:46,356 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 21:53:46,360 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:53:46,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:53:46 BoogieIcfgContainer [2023-11-06 21:53:46,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:53:46,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:53:46,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:53:46,516 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:53:46,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:41" (3/4) ... [2023-11-06 21:53:46,519 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:53:46,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:53:46,522 INFO L158 Benchmark]: Toolchain (without parser) took 5762.20ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 117.4MB in the beginning and 52.0MB in the end (delta: 65.4MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2023-11-06 21:53:46,522 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:46,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.47ms. Allocated memory is still 148.9MB. Free memory was 116.7MB in the beginning and 103.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 21:53:46,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.40ms. Allocated memory is still 148.9MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:46,524 INFO L158 Benchmark]: Boogie Preprocessor took 75.81ms. Allocated memory is still 148.9MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:53:46,524 INFO L158 Benchmark]: RCFGBuilder took 671.96ms. Allocated memory is still 148.9MB. Free memory was 99.3MB in the beginning and 100.5MB in the end (delta: -1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:46,525 INFO L158 Benchmark]: TraceAbstraction took 4588.67ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 99.8MB in the beginning and 52.0MB in the end (delta: 47.8MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2023-11-06 21:53:46,526 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 180.4MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:46,528 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.31ms. Allocated memory is still 123.7MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.47ms. Allocated memory is still 148.9MB. Free memory was 116.7MB in the beginning and 103.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.40ms. Allocated memory is still 148.9MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.81ms. Allocated memory is still 148.9MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 671.96ms. Allocated memory is still 148.9MB. Free memory was 99.3MB in the beginning and 100.5MB in the end (delta: -1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4588.67ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 99.8MB in the beginning and 52.0MB in the end (delta: 47.8MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 180.4MB. Free memory is still 52.0MB. 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 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L88] var_1_6 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L95] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L96] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L96] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L97] var_1_10 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L99] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L99] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L100] var_1_12 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L101] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L102] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L102] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L104] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L105] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L105] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L108] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L111] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L111] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L112] var_1_16 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L114] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L114] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L115] var_1_17 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L117] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L117] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L118] var_1_19 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L119] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L120] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L120] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L121] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L121] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L122] var_1_22 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L123] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L124] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L124] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L125] var_1_24 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L126] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L127] var_1_25 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=3, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=3, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L128] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=3, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L129] var_1_26 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L130] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=16319] [L143] RET updateVariables() [L144] CALL step() [L47] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L48] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L49] COND TRUE var_1_10 <= var_1_17 [L50] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L55] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L56] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L58] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L63] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L64] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=16255, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L68] COND FALSE !(\read(var_1_18)) [L71] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L73] COND TRUE \read(var_1_1) [L74] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=1, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_26=4, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=16191, var_1_9=16319] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 169 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 678 ConstructedInterpolants, 0 QuantifiedInterpolants, 2575 SizeOfPredicates, 6 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 5946/6048 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 [2023-11-06 21:53:46,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 a6e01815b85081eba7e0081229a01ecf7f6dda700f05238454388a259fe464fd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:49,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:49,356 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:53:49,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:49,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:49,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:49,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:49,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:49,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:49,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:49,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:49,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:49,413 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:49,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:49,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:49,416 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:49,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:49,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:49,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:49,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:49,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:49,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:53:49,418 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:53:49,419 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:53:49,419 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:49,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:49,420 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:49,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:49,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:49,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:49,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:49,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:49,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:49,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:49,424 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:53:49,424 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:53:49,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:49,426 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:49,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:49,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:49,428 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:53:49,428 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:49,428 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_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/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_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a6e01815b85081eba7e0081229a01ecf7f6dda700f05238454388a259fe464fd [2023-11-06 21:53:49,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:49,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:49,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:49,874 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:49,875 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:49,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i [2023-11-06 21:53:53,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:53,230 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:53,230 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i [2023-11-06 21:53:53,242 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/data/b407438c0/bcdf9d53a1704dcaa763dc5b100191d5/FLAG9938312be [2023-11-06 21:53:53,262 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/data/b407438c0/bcdf9d53a1704dcaa763dc5b100191d5 [2023-11-06 21:53:53,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:53,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:53,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:53,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:53,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:53,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ba71c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53, skipping insertion in model container [2023-11-06 21:53:53,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,334 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:53,536 WARN L240 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_1bd0966c-229a-4862-99c3-701c0d8e0de4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i[913,926] [2023-11-06 21:53:53,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:53,662 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:53,705 WARN L240 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_1bd0966c-229a-4862-99c3-701c0d8e0de4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-29.i[913,926] [2023-11-06 21:53:53,742 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:53,767 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:53,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53 WrapperNode [2023-11-06 21:53:53,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:53,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:53,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:53,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:53,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,851 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2023-11-06 21:53:53,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:53,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:53,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:53,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:53,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:53,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:53,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:53,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:53,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (1/1) ... [2023-11-06 21:53:53,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:53,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:53,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:53,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:53:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:54,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:54,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:54,117 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:54,119 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:57,161 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:57,174 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:57,177 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:53:57,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:57 BoogieIcfgContainer [2023-11-06 21:53:57,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:57,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:57,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:57,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:57,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:53" (1/3) ... [2023-11-06 21:53:57,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c2d72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:57, skipping insertion in model container [2023-11-06 21:53:57,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:53" (2/3) ... [2023-11-06 21:53:57,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c2d72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:57, skipping insertion in model container [2023-11-06 21:53:57,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:57" (3/3) ... [2023-11-06 21:53:57,195 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-29.i [2023-11-06 21:53:57,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:57,213 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:53:57,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:57,268 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3f2dcdb3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:57,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:53:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:53:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-06 21:53:57,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:57,296 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:57,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:57,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash 731389584, now seen corresponding path program 1 times [2023-11-06 21:53:57,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:53:57,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639758130] [2023-11-06 21:53:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:57,325 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 [2023-11-06 21:53:57,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:53:57,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:53:57,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:53:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:57,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:53:57,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-11-06 21:53:58,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:58,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:53:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639758130] [2023-11-06 21:53:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639758130] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1703634482] [2023-11-06 21:53:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 21:53:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 21:53:58,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 21:53:58,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2023-11-06 21:53:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:58,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 21:53:58,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:53:59,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:53:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1703634482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:59,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:53:59,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-06 21:53:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898525129] [2023-11-06 21:53:59,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:59,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:59,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:53:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:59,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:59,595 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:00,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:54:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:00,969 INFO L93 Difference]: Finished difference Result 202 states and 380 transitions. [2023-11-06 21:54:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2023-11-06 21:54:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:01,001 INFO L225 Difference]: With dead ends: 202 [2023-11-06 21:54:01,002 INFO L226 Difference]: Without dead ends: 133 [2023-11-06 21:54:01,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:01,011 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:01,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 21:54:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-06 21:54:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2023-11-06 21:54:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 21:54:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2023-11-06 21:54:01,088 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 170 [2023-11-06 21:54:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:01,090 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2023-11-06 21:54:01,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2023-11-06 21:54:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-06 21:54:01,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:01,096 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:01,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:54:01,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2023-11-06 21:54:01,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt [2023-11-06 21:54:01,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:01,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash 788647886, now seen corresponding path program 1 times [2023-11-06 21:54:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548264553] [2023-11-06 21:54:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:01,513 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 [2023-11-06 21:54:01,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:01,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:54:01,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:54:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:01,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:54:01,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-11-06 21:54:02,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:02,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:02,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548264553] [2023-11-06 21:54:02,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548264553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:02,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1370542608] [2023-11-06 21:54:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:02,169 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 21:54:02,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 21:54:02,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 21:54:02,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-06 21:54:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 21:54:03,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:54:03,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1370542608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:03,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:54:03,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 21:54:03,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179001193] [2023-11-06 21:54:03,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:03,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:03,173 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:04,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:54:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:06,581 INFO L93 Difference]: Finished difference Result 385 states and 605 transitions. [2023-11-06 21:54:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2023-11-06 21:54:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:06,587 INFO L225 Difference]: With dead ends: 385 [2023-11-06 21:54:06,588 INFO L226 Difference]: Without dead ends: 257 [2023-11-06 21:54:06,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:06,592 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 95 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:06,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-06 21:54:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-06 21:54:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2023-11-06 21:54:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2023-11-06 21:54:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 398 transitions. [2023-11-06 21:54:06,670 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 398 transitions. Word has length 170 [2023-11-06 21:54:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:06,673 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 398 transitions. [2023-11-06 21:54:06,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 398 transitions. [2023-11-06 21:54:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-06 21:54:06,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:06,683 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:06,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:54:06,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:07,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt [2023-11-06 21:54:07,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:07,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1731312048, now seen corresponding path program 1 times [2023-11-06 21:54:07,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:07,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208792022] [2023-11-06 21:54:07,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:07,101 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 [2023-11-06 21:54:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:07,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:54:07,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:54:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:07,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:54:07,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-11-06 21:54:07,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:07,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:07,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208792022] [2023-11-06 21:54:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208792022] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:07,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946549601] [2023-11-06 21:54:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:07,765 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 21:54:07,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 21:54:07,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 21:54:07,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-11-06 21:54:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:08,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:54:08,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-11-06 21:54:09,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-11-06 21:54:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [946549601] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:54:10,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:54:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-11-06 21:54:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912057119] [2023-11-06 21:54:10,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:10,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:54:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:10,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:54:10,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:54:10,028 INFO L87 Difference]: Start difference. First operand 255 states and 398 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2023-11-06 21:54:16,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 21:54:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:26,682 INFO L93 Difference]: Finished difference Result 701 states and 1052 transitions. [2023-11-06 21:54:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-06 21:54:26,684 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 170 [2023-11-06 21:54:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:26,690 INFO L225 Difference]: With dead ends: 701 [2023-11-06 21:54:26,690 INFO L226 Difference]: Without dead ends: 449 [2023-11-06 21:54:26,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 21:54:26,694 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 291 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:26,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 373 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2023-11-06 21:54:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-11-06 21:54:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 291. [2023-11-06 21:54:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 166 states have (on average 1.2048192771084338) internal successors, (200), 166 states have internal predecessors, (200), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2023-11-06 21:54:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2023-11-06 21:54:26,786 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 170 [2023-11-06 21:54:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:26,787 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2023-11-06 21:54:26,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2023-11-06 21:54:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2023-11-06 21:54:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-06 21:54:26,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:26,791 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:26,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:54:27,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-11-06 21:54:27,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt [2023-11-06 21:54:27,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:27,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1933300087, now seen corresponding path program 1 times [2023-11-06 21:54:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105787104] [2023-11-06 21:54:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:27,213 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 [2023-11-06 21:54:27,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:27,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:54:27,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:54:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:27,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:54:27,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:43,010 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from false [2023-11-06 21:54:45,018 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2023-11-06 21:54:53,504 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2023-11-06 21:54:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-11-06 21:54:58,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:58,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:58,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105787104] [2023-11-06 21:54:58,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105787104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:58,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:58,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 21:54:58,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700004871] [2023-11-06 21:54:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:58,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:54:58,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:54:58,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=88, Unknown=3, NotChecked=42, Total=182 [2023-11-06 21:54:58,103 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2023-11-06 21:55:18,787 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 110 DAG size of output: 243 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 21:55:20,814 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse7 (fp.neg .cse4)) (.cse6 (fp.neg .cse5))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6)))))))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-06 21:55:23,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:55:24,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:55:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:24,988 INFO L93 Difference]: Finished difference Result 909 states and 1302 transitions. [2023-11-06 21:55:24,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:55:24,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 171 [2023-11-06 21:55:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:25,001 INFO L225 Difference]: With dead ends: 909 [2023-11-06 21:55:25,001 INFO L226 Difference]: Without dead ends: 621 [2023-11-06 21:55:25,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=119, Invalid=227, Unknown=8, NotChecked=108, Total=462 [2023-11-06 21:55:25,004 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 193 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:25,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 338 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 302 Invalid, 0 Unknown, 447 Unchecked, 5.5s Time] [2023-11-06 21:55:25,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2023-11-06 21:55:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 609. [2023-11-06 21:55:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 352 states have (on average 1.1931818181818181) internal successors, (420), 352 states have internal predecessors, (420), 224 states have call successors, (224), 32 states have call predecessors, (224), 32 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2023-11-06 21:55:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 868 transitions. [2023-11-06 21:55:25,139 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 868 transitions. Word has length 171 [2023-11-06 21:55:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:25,148 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 868 transitions. [2023-11-06 21:55:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2023-11-06 21:55:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 868 transitions. [2023-11-06 21:55:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-06 21:55:25,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:25,154 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:25,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:55:25,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:55:25,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:25,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1681608839, now seen corresponding path program 1 times [2023-11-06 21:55:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160633210] [2023-11-06 21:55:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:25,375 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 [2023-11-06 21:55:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:25,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:55:25,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:55:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:55:25,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:41,537 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2023-11-06 21:55:49,377 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2023-11-06 21:55:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-11-06 21:55:54,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:55:54,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:55:54,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160633210] [2023-11-06 21:55:54,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160633210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:54,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:54,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 21:55:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883598874] [2023-11-06 21:55:54,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:54,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:55:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:55:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:55:54,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=89, Unknown=2, NotChecked=42, Total=182 [2023-11-06 21:55:54,053 INFO L87 Difference]: Start difference. First operand 609 states and 868 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2023-11-06 21:55:58,052 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse7 (fp.neg .cse4)) (.cse6 (fp.neg .cse5))) (let ((.cse8 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (fp.geq ~var_1_26~0 .cse6))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (fp.leq ~var_1_25~0 .cse7) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse7))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-06 21:56:03,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:56:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:03,620 INFO L93 Difference]: Finished difference Result 1383 states and 1967 transitions. [2023-11-06 21:56:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:56:03,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 171 [2023-11-06 21:56:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:03,636 INFO L225 Difference]: With dead ends: 1383 [2023-11-06 21:56:03,636 INFO L226 Difference]: Without dead ends: 777 [2023-11-06 21:56:03,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=113, Invalid=202, Unknown=3, NotChecked=102, Total=420 [2023-11-06 21:56:03,644 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 123 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:03,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 432 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 254 Invalid, 0 Unknown, 467 Unchecked, 6.7s Time] [2023-11-06 21:56:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2023-11-06 21:56:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 769. [2023-11-06 21:56:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 446 states have (on average 1.195067264573991) internal successors, (533), 446 states have internal predecessors, (533), 280 states have call successors, (280), 42 states have call predecessors, (280), 42 states have return successors, (280), 280 states have call predecessors, (280), 280 states have call successors, (280) [2023-11-06 21:56:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1093 transitions. [2023-11-06 21:56:03,793 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1093 transitions. Word has length 171 [2023-11-06 21:56:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:03,794 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 1093 transitions. [2023-11-06 21:56:03,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2023-11-06 21:56:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1093 transitions. [2023-11-06 21:56:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-06 21:56:03,797 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:03,797 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:03,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:04,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:04,016 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:56:04,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 691588410, now seen corresponding path program 1 times [2023-11-06 21:56:04,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:04,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776324831] [2023-11-06 21:56:04,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:04,018 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 [2023-11-06 21:56:04,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:04,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:56:04,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 21:56:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:04,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:56:04,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2023-11-06 21:56:04,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-11-06 21:56:05,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:05,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776324831] [2023-11-06 21:56:05,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776324831] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:05,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:05,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-11-06 21:56:05,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736376869] [2023-11-06 21:56:05,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:05,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:56:05,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:56:05,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:05,370 INFO L87 Difference]: Start difference. First operand 769 states and 1093 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2023-11-06 21:56:07,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:56:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:07,885 INFO L93 Difference]: Finished difference Result 2030 states and 2813 transitions. [2023-11-06 21:56:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:56:07,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 172 [2023-11-06 21:56:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:07,896 INFO L225 Difference]: With dead ends: 2030 [2023-11-06 21:56:07,897 INFO L226 Difference]: Without dead ends: 1264 [2023-11-06 21:56:07,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-11-06 21:56:07,903 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 116 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:07,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 238 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-06 21:56:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2023-11-06 21:56:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 809. [2023-11-06 21:56:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 476 states have (on average 1.1722689075630253) internal successors, (558), 476 states have internal predecessors, (558), 280 states have call successors, (280), 52 states have call predecessors, (280), 52 states have return successors, (280), 280 states have call predecessors, (280), 280 states have call successors, (280) [2023-11-06 21:56:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1118 transitions. [2023-11-06 21:56:08,098 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1118 transitions. Word has length 172 [2023-11-06 21:56:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:08,098 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1118 transitions. [2023-11-06 21:56:08,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2023-11-06 21:56:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1118 transitions. [2023-11-06 21:56:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-06 21:56:08,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:08,102 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:08,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:08,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:08,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:56:08,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash 748846712, now seen corresponding path program 1 times [2023-11-06 21:56:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:08,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42558864] [2023-11-06 21:56:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:08,322 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 [2023-11-06 21:56:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:08,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:56:08,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 21:56:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:08,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:56:08,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 258 proven. 144 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2023-11-06 21:56:09,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-11-06 21:56:10,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:10,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42558864] [2023-11-06 21:56:10,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42558864] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:10,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:10,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-06 21:56:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216491412] [2023-11-06 21:56:10,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:10,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 21:56:10,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:10,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 21:56:10,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:56:10,308 INFO L87 Difference]: Start difference. First operand 809 states and 1118 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2023-11-06 21:56:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:13,240 INFO L93 Difference]: Finished difference Result 1748 states and 2346 transitions. [2023-11-06 21:56:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 21:56:13,245 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 172 [2023-11-06 21:56:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:13,252 INFO L225 Difference]: With dead ends: 1748 [2023-11-06 21:56:13,252 INFO L226 Difference]: Without dead ends: 942 [2023-11-06 21:56:13,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2023-11-06 21:56:13,256 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 129 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:13,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 437 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-06 21:56:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2023-11-06 21:56:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 889. [2023-11-06 21:56:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 536 states have (on average 1.125) internal successors, (603), 536 states have internal predecessors, (603), 280 states have call successors, (280), 72 states have call predecessors, (280), 72 states have return successors, (280), 280 states have call predecessors, (280), 280 states have call successors, (280) [2023-11-06 21:56:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1163 transitions. [2023-11-06 21:56:13,446 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1163 transitions. Word has length 172 [2023-11-06 21:56:13,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:13,447 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1163 transitions. [2023-11-06 21:56:13,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2023-11-06 21:56:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1163 transitions. [2023-11-06 21:56:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-06 21:56:13,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:13,451 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:13,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:13,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:13,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:56:13,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:13,670 INFO L85 PathProgramCache]: Analyzing trace with hash -60499914, now seen corresponding path program 1 times [2023-11-06 21:56:13,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796653976] [2023-11-06 21:56:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:13,671 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 [2023-11-06 21:56:13,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:13,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:56:13,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bd0966c-229a-4862-99c3-701c0d8e0de4/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 21:56:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:14,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 21:56:14,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:46,928 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 21:57:11,963 WARN L293 SmtUtils]: Spent 10.89s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)