./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/drift_tenth.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8 --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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:07:58,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:07:58,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:07:58,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:07:58,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:07:58,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:07:58,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:07:58,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:07:58,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:07:58,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:07:58,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:07:58,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:07:58,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:07:58,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:07:58,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:07:58,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:07:58,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:07:58,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:07:58,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:07:58,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:07:58,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:07:58,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:07:58,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:07:58,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:07:58,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:07:58,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:07:58,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:07:58,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:07:58,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:07:58,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:07:58,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:07:58,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:07:58,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:07:58,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:07:58,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:07:58,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:07:58,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:07:58,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:07:58,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:07:58,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:07:58,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:07:58,154 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:07:58,191 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:07:58,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:07:58,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:07:58,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:07:58,197 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:07:58,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:07:58,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:07:58,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:07:58,198 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:07:58,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:07:58,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:07:58,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:07:58,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:07:58,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:07:58,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:07:58,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:07:58,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:07:58,201 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:07:58,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:07:58,202 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:07:58,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:07:58,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:07:58,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:07:58,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:07:58,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:07:58,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:07:58,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:07:58,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:07:58,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:07:58,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:07:58,205 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:07:58,205 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:07:58,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:07:58,205 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/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_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2022-11-16 11:07:58,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:07:58,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:07:58,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:07:58,489 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:07:58,490 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:07:58,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-16 11:07:58,572 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data/9c50ed584/3144e9f4251349819372edf55e060615/FLAGee2d5f25b [2022-11-16 11:07:59,190 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:07:59,191 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-16 11:07:59,198 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data/9c50ed584/3144e9f4251349819372edf55e060615/FLAGee2d5f25b [2022-11-16 11:07:59,572 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data/9c50ed584/3144e9f4251349819372edf55e060615 [2022-11-16 11:07:59,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:07:59,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:07:59,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:07:59,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:07:59,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:07:59,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dcc58b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59, skipping insertion in model container [2022-11-16 11:07:59,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:07:59,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:07:59,822 WARN L229 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_e7104774-eb80-47a1-8f2e-d13a91d34cbd/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-16 11:07:59,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:07:59,852 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:07:59,872 WARN L229 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_e7104774-eb80-47a1-8f2e-d13a91d34cbd/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-16 11:07:59,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:07:59,893 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:07:59,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59 WrapperNode [2022-11-16 11:07:59,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:07:59,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:07:59,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:07:59,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:07:59,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,935 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2022-11-16 11:07:59,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:07:59,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:07:59,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:07:59,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:07:59,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:07:59,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:07:59,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:07:59,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:07:59,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (1/1) ... [2022-11-16 11:07:59,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:08:00,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:08:00,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:08:00,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:08:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:08:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:08:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:08:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:08:00,152 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:08:00,154 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:08:00,319 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:08:00,325 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:08:00,325 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:08:00,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:08:00 BoogieIcfgContainer [2022-11-16 11:08:00,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:08:00,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:08:00,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:08:00,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:08:00,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:07:59" (1/3) ... [2022-11-16 11:08:00,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be35462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:08:00, skipping insertion in model container [2022-11-16 11:08:00,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:07:59" (2/3) ... [2022-11-16 11:08:00,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be35462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:08:00, skipping insertion in model container [2022-11-16 11:08:00,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:08:00" (3/3) ... [2022-11-16 11:08:00,340 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2022-11-16 11:08:00,362 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:08:00,362 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:08:00,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:08:00,446 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;@16ca562a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:08:00,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:08:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:08:00,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:00,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:08:00,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-11-16 11:08:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:08:00,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290439229] [2022-11-16 11:08:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:08:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:00,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:08:00,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290439229] [2022-11-16 11:08:00,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290439229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:08:00,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:08:00,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:08:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461535285] [2022-11-16 11:08:00,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:08:00,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:08:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:08:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:08:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:08:00,753 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:08:00,811 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-11-16 11:08:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:08:00,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 11:08:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:08:00,822 INFO L225 Difference]: With dead ends: 22 [2022-11-16 11:08:00,823 INFO L226 Difference]: Without dead ends: 10 [2022-11-16 11:08:00,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:08:00,842 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:08:00,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:08:00,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-16 11:08:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-11-16 11:08:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-16 11:08:00,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-11-16 11:08:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:08:00,877 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-16 11:08:00,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-16 11:08:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:08:00,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:00,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:08:00,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:08:00,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:00,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-11-16 11:08:00,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:08:00,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777274427] [2022-11-16 11:08:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:08:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:08:00,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777274427] [2022-11-16 11:08:00,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777274427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:08:00,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586770771] [2022-11-16 11:08:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:00,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:08:00,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:08:00,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:08:00,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:08:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:01,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:08:01,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:08:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:01,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:08:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:01,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586770771] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:08:01,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:08:01,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-16 11:08:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986746967] [2022-11-16 11:08:01,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:08:01,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:08:01,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:08:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:08:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:08:01,168 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:08:01,211 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-16 11:08:01,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:08:01,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 11:08:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:08:01,212 INFO L225 Difference]: With dead ends: 19 [2022-11-16 11:08:01,213 INFO L226 Difference]: Without dead ends: 15 [2022-11-16 11:08:01,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:08:01,215 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:08:01,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:08:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-16 11:08:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-16 11:08:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-16 11:08:01,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-16 11:08:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:08:01,224 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-16 11:08:01,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-16 11:08:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:08:01,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:01,226 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 11:08:01,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:08:01,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:08:01,431 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2022-11-16 11:08:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:08:01,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478724899] [2022-11-16 11:08:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:08:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:08:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478724899] [2022-11-16 11:08:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478724899] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:08:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063332521] [2022-11-16 11:08:01,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:08:01,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:08:01,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:08:01,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:08:01,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:08:01,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:08:01,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:08:01,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:08:01,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:08:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:01,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:08:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:01,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063332521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:08:01,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:08:01,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-16 11:08:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109113435] [2022-11-16 11:08:01,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:08:01,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:08:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:08:01,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:08:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:08:01,765 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:08:01,850 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-11-16 11:08:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:08:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:08:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:08:01,852 INFO L225 Difference]: With dead ends: 31 [2022-11-16 11:08:01,852 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 11:08:01,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:08:01,854 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:08:01,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:08:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 11:08:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-16 11:08:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-16 11:08:01,862 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2022-11-16 11:08:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:08:01,862 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-16 11:08:01,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-16 11:08:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:08:01,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:01,864 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-11-16 11:08:01,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 11:08:02,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:08:02,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 3 times [2022-11-16 11:08:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:08:02,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516217099] [2022-11-16 11:08:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:08:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:08:02,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:08:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:08:02,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:08:02,166 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:08:02,166 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:08:02,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:08:02,172 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1] [2022-11-16 11:08:02,175 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:08:02,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:08:02 BoogieIcfgContainer [2022-11-16 11:08:02,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:08:02,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:08:02,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:08:02,201 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:08:02,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:08:00" (3/4) ... [2022-11-16 11:08:02,205 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:08:02,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:08:02,206 INFO L158 Benchmark]: Toolchain (without parser) took 2627.72ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 81.0MB in the beginning and 80.6MB in the end (delta: 358.8kB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2022-11-16 11:08:02,206 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 111.1MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:08:02,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.98ms. Allocated memory is still 111.1MB. Free memory was 81.0MB in the beginning and 86.8MB in the end (delta: -5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:08:02,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.58ms. Allocated memory is still 111.1MB. Free memory was 86.8MB in the beginning and 85.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:08:02,208 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:08:02,208 INFO L158 Benchmark]: RCFGBuilder took 356.27ms. Allocated memory is still 111.1MB. Free memory was 84.3MB in the beginning and 75.2MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:08:02,209 INFO L158 Benchmark]: TraceAbstraction took 1870.93ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 74.5MB in the beginning and 81.3MB in the end (delta: -6.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2022-11-16 11:08:02,209 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 80.6MB in the end (delta: 721.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:08:02,212 INFO L339 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 111.1MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.98ms. Allocated memory is still 111.1MB. Free memory was 81.0MB in the beginning and 86.8MB in the end (delta: -5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.58ms. Allocated memory is still 111.1MB. Free memory was 86.8MB in the beginning and 85.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 356.27ms. Allocated memory is still 111.1MB. Free memory was 84.3MB in the beginning and 75.2MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1870.93ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 74.5MB in the beginning and 81.3MB in the end (delta: -6.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 80.6MB in the end (delta: 721.2kB). Peak memory consumption was 2.1MB. 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: 6]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 15. Possible FailurePath: [L10] float tick = 1.f / 10.f; [L11] float time = 0.f; [L12] int i; [L14] i = 0 VAL [i=0, time=0] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=0] [L14] i++ VAL [i=1] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=1] [L14] i++ VAL [i=2] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=2] [L14] i++ VAL [i=3] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=3] [L14] i++ VAL [i=4] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=4] [L14] i++ VAL [i=5] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=5] [L14] i++ VAL [i=6] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=6] [L14] i++ VAL [i=7] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=7] [L14] i++ VAL [i=8] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=8] [L14] i++ VAL [i=9] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=9] [L14] i++ VAL [i=10] [L14] COND FALSE !(i < 10) VAL [i=10] [L17] CALL __VERIFIER_assert(time != 1.0) [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 22 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/51 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 [2022-11-16 11:08:02,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8 --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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:08:04,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:08:04,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:08:04,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:08:04,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:08:04,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:08:04,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:08:04,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:08:04,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:08:04,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:08:04,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:08:04,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:08:04,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:08:04,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:08:04,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:08:04,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:08:04,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:08:04,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:08:04,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:08:04,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:08:04,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:08:04,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:08:04,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:08:04,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:08:04,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:08:04,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:08:04,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:08:04,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:08:04,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:08:04,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:08:04,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:08:04,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:08:04,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:08:04,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:08:04,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:08:04,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:08:04,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:08:04,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:08:04,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:08:04,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:08:04,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:08:04,813 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 11:08:04,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:08:04,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:08:04,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:08:04,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:08:04,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:08:04,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:08:04,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:08:04,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:08:04,863 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:08:04,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:08:04,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:08:04,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:08:04,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:08:04,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:08:04,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:08:04,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:08:04,867 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:08:04,867 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:08:04,868 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:08:04,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:08:04,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:08:04,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:08:04,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:08:04,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:08:04,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:08:04,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:08:04,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:08:04,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:08:04,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:08:04,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:08:04,872 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:08:04,872 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:08:04,872 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:08:04,873 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:08:04,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:08:04,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:08:04,873 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/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_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2022-11-16 11:08:05,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:08:05,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:08:05,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:08:05,351 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:08:05,352 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:08:05,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-16 11:08:05,432 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data/9311335a9/17c522a1c4994f7dba0c145df66217d7/FLAG9557c9899 [2022-11-16 11:08:05,889 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:08:05,890 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-16 11:08:05,900 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data/9311335a9/17c522a1c4994f7dba0c145df66217d7/FLAG9557c9899 [2022-11-16 11:08:06,309 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/data/9311335a9/17c522a1c4994f7dba0c145df66217d7 [2022-11-16 11:08:06,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:08:06,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:08:06,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:08:06,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:08:06,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:08:06,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4babbf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06, skipping insertion in model container [2022-11-16 11:08:06,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:08:06,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:08:06,525 WARN L229 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_e7104774-eb80-47a1-8f2e-d13a91d34cbd/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-16 11:08:06,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:08:06,570 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:08:06,593 WARN L229 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_e7104774-eb80-47a1-8f2e-d13a91d34cbd/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-16 11:08:06,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:08:06,631 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:08:06,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06 WrapperNode [2022-11-16 11:08:06,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:08:06,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:08:06,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:08:06,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:08:06,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,664 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-16 11:08:06,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:08:06,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:08:06,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:08:06,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:08:06,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:08:06,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:08:06,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:08:06,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:08:06,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (1/1) ... [2022-11-16 11:08:06,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:08:06,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:08:06,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:08:06,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:08:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:08:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:08:06,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:08:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:08:06,832 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:08:06,834 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:08:07,154 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:08:07,160 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:08:07,160 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:08:07,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:08:07 BoogieIcfgContainer [2022-11-16 11:08:07,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:08:07,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:08:07,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:08:07,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:08:07,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:08:06" (1/3) ... [2022-11-16 11:08:07,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e9a8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:08:07, skipping insertion in model container [2022-11-16 11:08:07,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:08:06" (2/3) ... [2022-11-16 11:08:07,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e9a8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:08:07, skipping insertion in model container [2022-11-16 11:08:07,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:08:07" (3/3) ... [2022-11-16 11:08:07,170 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2022-11-16 11:08:07,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:08:07,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:08:07,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:08:07,263 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;@1ef3d80f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:08:07,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:08:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:08:07,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:07,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:08:07,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:07,317 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-11-16 11:08:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:08:07,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088247575] [2022-11-16 11:08:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:07,348 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 [2022-11-16 11:08:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:08:07,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 11:08:07,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 11:08:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:07,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:08:07,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:08:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:07,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:08:07,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:08:07,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088247575] [2022-11-16 11:08:07,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088247575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:08:07,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:08:07,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:08:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433859084] [2022-11-16 11:08:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:08:07,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:08:07,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:08:07,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:08:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:08:07,584 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:08:07,800 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-11-16 11:08:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:08:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 11:08:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:08:07,822 INFO L225 Difference]: With dead ends: 22 [2022-11-16 11:08:07,831 INFO L226 Difference]: Without dead ends: 10 [2022-11-16 11:08:07,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:08:07,839 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:08:07,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:08:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-16 11:08:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-11-16 11:08:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-16 11:08:07,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-11-16 11:08:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:08:07,887 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-16 11:08:07,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-16 11:08:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:08:07,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:07,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:08:07,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 11:08:08,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:08:08,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-11-16 11:08:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:08:08,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101707164] [2022-11-16 11:08:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:08,106 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 [2022-11-16 11:08:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:08:08,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 11:08:08,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:08:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:08,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:08:08,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:08:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:08,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:08:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:08,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:08:08,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101707164] [2022-11-16 11:08:08,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101707164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:08:08,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:08:08,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-16 11:08:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591430599] [2022-11-16 11:08:08,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:08:08,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:08:08,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:08:08,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:08:08,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:08:08,270 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:08:08,557 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-16 11:08:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:08:08,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 11:08:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:08:08,562 INFO L225 Difference]: With dead ends: 19 [2022-11-16 11:08:08,562 INFO L226 Difference]: Without dead ends: 15 [2022-11-16 11:08:08,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:08:08,564 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:08:08,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:08:08,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-16 11:08:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-16 11:08:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-16 11:08:08,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-16 11:08:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:08:08,571 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-16 11:08:08,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:08:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-16 11:08:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:08:08,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:08,572 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 11:08:08,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 11:08:08,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:08:08,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:08,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2022-11-16 11:08:08,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:08:08,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000095157] [2022-11-16 11:08:08,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:08:08,803 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 [2022-11-16 11:08:08,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:08:08,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 11:08:08,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 11:08:08,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:08:08,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:08:08,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:08:08,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:08:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:08:17,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:09:43,866 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-16 11:09:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 10 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-16 11:09:45,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:09:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000095157] [2022-11-16 11:09:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000095157] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:09:45,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:09:45,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-16 11:09:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638348900] [2022-11-16 11:09:45,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:09:45,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:09:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:09:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:09:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=124, Unknown=13, NotChecked=24, Total=210 [2022-11-16 11:09:45,071 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:09:46,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:09:48,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:09:52,349 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:09:54,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:10:18,894 WARN L233 SmtUtils]: Spent 10.90s on a formula simplification. DAG size of input: 24 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:10:20,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:10:23,149 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|))) (let ((.cse3 (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse2) .cse2) .cse2) .cse2)) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-16 11:10:25,188 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|))) (let ((.cse3 (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse2) .cse2) .cse2) .cse2)) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-16 11:10:28,479 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)))) is different from true [2022-11-16 11:10:30,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:10:32,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:10:57,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:05,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:07,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:09,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:11,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:13,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:16,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:19,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:32,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:35,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:37,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:39,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:41,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:43,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:45,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 11:11:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:11:45,650 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-16 11:11:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:11:45,651 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:11:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:11:45,652 INFO L225 Difference]: With dead ends: 31 [2022-11-16 11:11:45,652 INFO L226 Difference]: Without dead ends: 23 [2022-11-16 11:11:45,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 150.9s TimeCoverageRelationStatistics Valid=91, Invalid=240, Unknown=27, NotChecked=148, Total=506 [2022-11-16 11:11:45,654 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 45.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:11:45,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 15 Unknown, 31 Unchecked, 45.8s Time] [2022-11-16 11:11:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-16 11:11:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-16 11:11:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:11:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-11-16 11:11:45,661 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 14 [2022-11-16 11:11:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:11:45,662 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-11-16 11:11:45,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:11:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-11-16 11:11:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:11:45,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:11:45,664 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2022-11-16 11:11:45,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 11:11:45,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:11:45,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:11:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:11:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -248120899, now seen corresponding path program 3 times [2022-11-16 11:11:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:11:45,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896559376] [2022-11-16 11:11:45,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:11:45,874 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 [2022-11-16 11:11:45,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:11:45,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 11:11:45,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:11:46,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-16 11:11:46,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:11:46,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:11:46,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:11:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:11:46,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:11:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:11:47,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:11:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896559376] [2022-11-16 11:11:47,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896559376] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:11:47,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:11:47,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-16 11:11:47,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561290916] [2022-11-16 11:11:47,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:11:47,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:11:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:11:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:11:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:11:47,337 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:11:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:11:49,021 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-11-16 11:11:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:11:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 11:11:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:11:49,028 INFO L225 Difference]: With dead ends: 31 [2022-11-16 11:11:49,028 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 11:11:49,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:11:49,032 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:11:49,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 11:11:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 11:11:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-16 11:11:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:11:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-16 11:11:49,054 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2022-11-16 11:11:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:11:49,055 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-16 11:11:49,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:11:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-16 11:11:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:11:49,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:11:49,057 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-11-16 11:11:49,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 11:11:49,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:11:49,258 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:11:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:11:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 4 times [2022-11-16 11:11:49,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:11:49,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273711526] [2022-11-16 11:11:49,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:11:49,259 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 [2022-11-16 11:11:49,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:11:49,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 11:11:49,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 11:11:49,588 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:11:49,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:11:49,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:11:49,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:44,048 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:13:24,640 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:13:37,019 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:13:39,051 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:13:54,898 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:14:08,447 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:14:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 47 refuted. 2 times theorem prover too weak. 0 trivial. 51 not checked. [2022-11-16 11:14:20,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:15:31,876 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-16 11:15:41,682 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-16 11:15:43,707 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-16 11:15:53,737 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-16 11:16:05,197 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-16 11:16:15,101 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-16 11:16:27,355 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-16 11:16:29,400 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-16 11:16:39,653 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-16 11:16:41,703 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-16 11:16:51,979 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-16 11:16:54,035 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-16 11:17:00,179 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-16 11:17:02,223 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-16 11:17:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 94 not checked. [2022-11-16 11:17:02,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:17:02,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273711526] [2022-11-16 11:17:02,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273711526] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:02,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:17:02,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-11-16 11:17:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480569401] [2022-11-16 11:17:02,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:02,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 11:17:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:17:02,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 11:17:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=180, Unknown=29, NotChecked=468, Total=756 [2022-11-16 11:17:02,228 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:04,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:17:06,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:17:08,953 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:17:11,008 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:17:13,067 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:17:15,122 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:17:17,189 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:17:19,242 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:17:22,331 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-11-16 11:17:24,382 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-11-16 11:17:26,444 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:17:29,056 WARN L833 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:17:31,097 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:17:33,156 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|)) is different from false [2022-11-16 11:17:37,151 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:17:41,062 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:17:44,477 WARN L833 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-16 11:17:47,500 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1|) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-16 11:17:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:47,516 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-11-16 11:17:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:17:47,517 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 11:17:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:47,518 INFO L225 Difference]: With dead ends: 33 [2022-11-16 11:17:47,518 INFO L226 Difference]: Without dead ends: 29 [2022-11-16 11:17:47,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 220.8s TimeCoverageRelationStatistics Valid=103, Invalid=188, Unknown=45, NotChecked=1224, Total=1560 [2022-11-16 11:17:47,520 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:47,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 1 Unknown, 81 Unchecked, 4.7s Time] [2022-11-16 11:17:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-16 11:17:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-16 11:17:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-11-16 11:17:47,529 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2022-11-16 11:17:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:47,530 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-11-16 11:17:47,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-11-16 11:17:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:17:47,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:47,532 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:47,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 11:17:47,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:17:47,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:47,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1723013437, now seen corresponding path program 5 times [2022-11-16 11:17:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:17:47,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780513521] [2022-11-16 11:17:47,753 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:17:47,753 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 [2022-11-16 11:17:47,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:17:47,755 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 11:17:47,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 11:17:48,185 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-16 11:17:48,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:48,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:17:48,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:48,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:49,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:17:49,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780513521] [2022-11-16 11:17:49,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780513521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:49,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:17:49,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-16 11:17:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184180975] [2022-11-16 11:17:49,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:49,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 11:17:49,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:17:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 11:17:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-11-16 11:17:49,839 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:52,045 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-11-16 11:17:52,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:17:52,046 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-16 11:17:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:52,047 INFO L225 Difference]: With dead ends: 29 [2022-11-16 11:17:52,047 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 11:17:52,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-11-16 11:17:52,049 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:52,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-16 11:17:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 11:17:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 11:17:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 11:17:52,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-11-16 11:17:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:52,052 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 11:17:52,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 11:17:52,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 11:17:52,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:17:52,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:52,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7104774-eb80-47a1-8f2e-d13a91d34cbd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:17:52,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.