./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad ................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:02:06,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:02:06,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:02:06,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:02:06,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:02:06,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:02:06,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:02:06,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:02:06,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:02:06,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:02:06,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:02:06,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:02:06,919 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:02:06,919 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:02:06,920 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:02:06,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:02:06,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:02:06,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:02:06,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:02:06,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:02:06,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:02:06,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:02:06,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:02:06,928 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:02:06,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:02:06,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:02:06,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:02:06,930 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:02:06,931 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:02:06,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:02:06,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:02:06,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:02:06,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:02:06,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:02:06,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:02:06,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:02:06,934 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 10:02:06,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:02:06,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:02:06,945 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:02:06,945 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:02:06,946 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:02:06,946 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:02:06,946 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:02:06,946 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:02:06,946 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:02:06,946 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:02:06,946 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:02:06,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:02:06,947 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:02:06,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:02:06,947 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:02:06,947 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:02:06,947 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:02:06,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:02:06,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:02:06,948 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:02:06,948 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:02:06,948 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:02:06,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:02:06,948 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:02:06,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:02:06,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:02:06,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:02:06,949 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:02:06,949 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:02:06,949 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:02:06,949 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:02:06,950 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:02:06,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:02:06,950 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:02:06,950 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad [2018-11-10 10:02:06,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:02:06,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:02:06,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:02:06,987 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:02:06,987 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:02:06,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 10:02:07,034 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data/84fe908db/6172f8cd2817408cb23645918effd015/FLAGd8bc8270a [2018-11-10 10:02:07,358 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:02:07,359 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 10:02:07,363 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data/84fe908db/6172f8cd2817408cb23645918effd015/FLAGd8bc8270a [2018-11-10 10:02:07,371 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data/84fe908db/6172f8cd2817408cb23645918effd015 [2018-11-10 10:02:07,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:02:07,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:02:07,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:02:07,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:02:07,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:02:07,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4224e6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07, skipping insertion in model container [2018-11-10 10:02:07,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:02:07,397 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:02:07,501 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:02:07,505 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:02:07,514 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:02:07,523 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:02:07,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07 WrapperNode [2018-11-10 10:02:07,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:02:07,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:02:07,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:02:07,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:02:07,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:02:07,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:02:07,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:02:07,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:02:07,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2018-11-10 10:02:07,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:02:07,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:02:07,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:02:07,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:02:07,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:02:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:02:07,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:02:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:02:07,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:02:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:02:07,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:02:07,728 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:02:07,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:02:07 BoogieIcfgContainer [2018-11-10 10:02:07,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:02:07,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:02:07,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:02:07,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:02:07,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:02:07" (1/3) ... [2018-11-10 10:02:07,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100a96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:07, skipping insertion in model container [2018-11-10 10:02:07,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (2/3) ... [2018-11-10 10:02:07,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100a96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:07, skipping insertion in model container [2018-11-10 10:02:07,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:02:07" (3/3) ... [2018-11-10 10:02:07,733 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 10:02:07,739 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:02:07,745 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:02:07,756 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:02:07,777 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:02:07,777 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:02:07,777 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:02:07,777 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:02:07,777 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:02:07,777 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:02:07,777 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:02:07,777 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:02:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-10 10:02:07,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 10:02:07,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:02:07,791 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:02:07,793 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:02:07,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:02:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-10 10:02:07,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:02:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:02:07,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:02:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:02:07,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:02:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:02:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:02:07,874 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:02:07,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:02:07 BoogieIcfgContainer [2018-11-10 10:02:07,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:02:07,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:02:07,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:02:07,891 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:02:07,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:02:07" (3/4) ... [2018-11-10 10:02:07,894 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:02:07,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:02:07,894 INFO L168 Benchmark]: Toolchain (without parser) took 520.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:02:07,895 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:02:07,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.13 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:02:07,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:02:07,896 INFO L168 Benchmark]: Boogie Preprocessor took 14.67 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:02:07,897 INFO L168 Benchmark]: RCFGBuilder took 172.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 942.4 MB in the beginning and 1.2 GB in the end (delta: -209.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:02:07,897 INFO L168 Benchmark]: TraceAbstraction took 161.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:02:07,898 INFO L168 Benchmark]: Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:02:07,900 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.13 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.67 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 942.4 MB in the beginning and 1.2 GB in the end (delta: -209.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 161.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 25]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] float main__x = 1.0; [L8] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:02:09,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:02:09,339 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:02:09,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:02:09,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:02:09,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:02:09,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:02:09,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:02:09,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:02:09,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:02:09,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:02:09,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:02:09,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:02:09,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:02:09,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:02:09,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:02:09,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:02:09,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:02:09,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:02:09,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:02:09,361 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:02:09,362 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:02:09,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:02:09,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:02:09,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:02:09,366 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:02:09,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:02:09,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:02:09,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:02:09,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:02:09,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:02:09,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:02:09,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:02:09,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:02:09,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:02:09,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:02:09,371 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 10:02:09,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:02:09,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:02:09,383 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:02:09,384 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:02:09,384 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:02:09,384 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:02:09,384 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:02:09,384 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:02:09,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:02:09,385 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:02:09,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:02:09,387 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:02:09,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:02:09,387 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:02:09,387 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:02:09,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:02:09,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:02:09,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:02:09,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:02:09,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:02:09,388 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 10:02:09,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:02:09,388 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:02:09,388 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 10:02:09,388 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> c3b46b0a01de4b9e0cf3e5cf7ccb067d9e1dbfad [2018-11-10 10:02:09,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:02:09,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:02:09,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:02:09,429 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:02:09,430 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:02:09,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 10:02:09,466 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data/6b8261b3a/2ea4cacada7c4f098e65e97d7292407c/FLAG50f79559b [2018-11-10 10:02:09,861 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:02:09,861 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 10:02:09,865 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data/6b8261b3a/2ea4cacada7c4f098e65e97d7292407c/FLAG50f79559b [2018-11-10 10:02:09,874 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/data/6b8261b3a/2ea4cacada7c4f098e65e97d7292407c [2018-11-10 10:02:09,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:02:09,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:02:09,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:02:09,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:02:09,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:02:09,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:09" (1/1) ... [2018-11-10 10:02:09,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72878137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:09, skipping insertion in model container [2018-11-10 10:02:09,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:09" (1/1) ... [2018-11-10 10:02:09,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:02:09,899 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:02:10,002 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:02:10,007 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:02:10,017 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:02:10,027 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:02:10,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10 WrapperNode [2018-11-10 10:02:10,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:02:10,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:02:10,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:02:10,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:02:10,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:02:10,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:02:10,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:02:10,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:02:10,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... [2018-11-10 10:02:10,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:02:10,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:02:10,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:02:10,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:02:10,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:02:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:02:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:02:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:02:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:02:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:02:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:02:12,425 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:02:12,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:02:12 BoogieIcfgContainer [2018-11-10 10:02:12,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:02:12,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:02:12,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:02:12,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:02:12,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:02:09" (1/3) ... [2018-11-10 10:02:12,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a117d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:12, skipping insertion in model container [2018-11-10 10:02:12,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:10" (2/3) ... [2018-11-10 10:02:12,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a117d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:12, skipping insertion in model container [2018-11-10 10:02:12,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:02:12" (3/3) ... [2018-11-10 10:02:12,430 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-10 10:02:12,436 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:02:12,441 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:02:12,450 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:02:12,468 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:02:12,468 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:02:12,468 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:02:12,468 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:02:12,469 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:02:12,469 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:02:12,469 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:02:12,469 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:02:12,469 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:02:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-10 10:02:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 10:02:12,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:02:12,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:02:12,486 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:02:12,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:02:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-10 10:02:12,492 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:02:12,492 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-10 10:02:12,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:02:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:12,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:02:14,955 WARN L854 $PredicateComparison]: unable to prove that (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-11-10 10:02:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:02:14,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:02:14,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:02:14,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:02:14,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:02:14,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:02:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-10 10:02:14,987 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-11-10 10:02:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:02:14,999 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-10 10:02:14,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:02:14,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-10 10:02:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:02:15,005 INFO L225 Difference]: With dead ends: 22 [2018-11-10 10:02:15,005 INFO L226 Difference]: Without dead ends: 11 [2018-11-10 10:02:15,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-10 10:02:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-11-10 10:02:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-10 10:02:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 10:02:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-10 10:02:15,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-11-10 10:02:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:02:15,030 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-11-10 10:02:15,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:02:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-10 10:02:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:02:15,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:02:15,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:02:15,031 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:02:15,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:02:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-11-10 10:02:15,032 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:02:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-10 10:02:15,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:02:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:15,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:02:23,028 WARN L179 SmtUtils]: Spent 4.55 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 10:02:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:02:23,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:02:27,441 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-10 10:02:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-10 10:02:29,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:02:29,128 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:02:29,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:02:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-10 10:02:41,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:02:41,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 10:02:41,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:02:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:02:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-11-10 10:02:41,596 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-11-10 10:02:43,812 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:02:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:02:52,983 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-10 10:02:52,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:02:52,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-10 10:02:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:02:52,985 INFO L225 Difference]: With dead ends: 15 [2018-11-10 10:02:52,985 INFO L226 Difference]: Without dead ends: 12 [2018-11-10 10:02:52,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=12, Invalid=13, Unknown=3, NotChecked=14, Total=42 [2018-11-10 10:02:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-10 10:02:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-10 10:02:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 10:02:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-10 10:02:52,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-10 10:02:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:02:52,989 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-10 10:02:52,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:02:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-10 10:02:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:02:52,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:02:52,990 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:02:52,990 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:02:52,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:02:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-11-10 10:02:52,990 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:02:52,990 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-10 10:02:52,994 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 10:02:53,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:02:53,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:02:53,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:02:55,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))))) is different from true [2018-11-10 10:02:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 10:02:55,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:03:20,033 WARN L179 SmtUtils]: Spent 10.03 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-10 10:03:22,421 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:03:24,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:03:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 10:03:24,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:03:24,835 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:03:24,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:03:38,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:03:38,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-10 10:03:39,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:03:39,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-10 10:03:39,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:03:39,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:03:39,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=26, Unknown=7, NotChecked=22, Total=72 [2018-11-10 10:03:39,616 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-11-10 10:03:42,035 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)) (let ((.cse2 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (or (fp.eq .cse2 .cse1) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse2) .cse0)) .cse2)))))) is different from true [2018-11-10 10:03:53,079 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:04:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:04:01,269 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-10 10:04:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:04:01,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-11-10 10:04:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:04:01,270 INFO L225 Difference]: With dead ends: 16 [2018-11-10 10:04:01,270 INFO L226 Difference]: Without dead ends: 13 [2018-11-10 10:04:01,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=26, Invalid=36, Unknown=10, NotChecked=60, Total=132 [2018-11-10 10:04:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-10 10:04:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 10:04:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 10:04:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-10 10:04:01,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-10 10:04:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:04:01,274 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-10 10:04:01,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:04:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-10 10:04:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 10:04:01,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:04:01,275 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:04:01,275 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:04:01,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-11-10 10:04:01,276 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:04:01,276 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-10 10:04:01,281 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 10:04:02,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 10:04:02,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:04:02,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:04,579 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:04:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-10 10:04:04,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:04:07,513 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from true [2018-11-10 10:04:09,940 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:04:12,360 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:04:14,974 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:04:17,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:04:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-10 10:04:17,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:04:17,614 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:04:17,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:04:42,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 10:04:42,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-10 10:04:43,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:04:43,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-10 10:04:43,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:04:43,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:04:43,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=33, Unknown=6, NotChecked=52, Total=110 [2018-11-10 10:04:43,368 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-11-10 10:04:46,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)) (let ((.cse2 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse2) .cse0)) .cse2)) (fp.eq .cse2 .cse1))))) is different from true [2018-11-10 10:04:48,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:04:50,687 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:04:52,908 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:04:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:04:58,493 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-10 10:04:58,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:04:58,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-11-10 10:04:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:04:58,494 INFO L225 Difference]: With dead ends: 17 [2018-11-10 10:04:58,494 INFO L226 Difference]: Without dead ends: 14 [2018-11-10 10:04:58,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=27, Invalid=37, Unknown=10, NotChecked=136, Total=210 [2018-11-10 10:04:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-10 10:04:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-10 10:04:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 10:04:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-10 10:04:58,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-10 10:04:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:04:58,498 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-10 10:04:58,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:04:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-10 10:04:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 10:04:58,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:04:58,499 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:04:58,499 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:04:58,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2018-11-10 10:04:58,499 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:04:58,499 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-10 10:04:58,502 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:04:59,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:04:59,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:04:59,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:05:01,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:05:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-11-10 10:05:01,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:05:04,185 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-10 10:05:06,395 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-11-10 10:05:08,825 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:05:11,250 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:05:13,907 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:05:16,560 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:05:19,387 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:05:22,241 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:05:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-11-10 10:05:22,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:05:22,273 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:05:22,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:05:46,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:05:46,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-10 10:05:47,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:05:47,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-10 10:05:47,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:05:47,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:05:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=32, Unknown=9, NotChecked=70, Total=132 [2018-11-10 10:05:47,344 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-11-10 10:05:50,196 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 10:05:52,840 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:05:55,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 10:05:57,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:05:59,720 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:06:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:06:05,681 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-10 10:06:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:06:05,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-11-10 10:06:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:06:05,682 INFO L225 Difference]: With dead ends: 18 [2018-11-10 10:06:05,682 INFO L226 Difference]: Without dead ends: 15 [2018-11-10 10:06:05,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=31, Invalid=37, Unknown=14, NotChecked=190, Total=272 [2018-11-10 10:06:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-10 10:06:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 10:06:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 10:06:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-10 10:06:05,686 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-10 10:06:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:06:05,687 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-10 10:06:05,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:06:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-10 10:06:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 10:06:05,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:06:05,688 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:06:05,688 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:06:05,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:06:05,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2018-11-10 10:06:05,688 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:06:05,688 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-10 10:06:05,691 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-10 10:06:07,358 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-10 10:06:07,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:06:07,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:06:09,720 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x~0) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:06:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-10 10:06:09,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:06:11,982 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-10 10:06:15,307 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:06:17,758 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:06:20,399 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:06:23,045 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:06:25,913 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:06:28,771 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:06:31,822 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:06:34,892 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:06:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-11-10 10:06:34,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:06:34,931 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:06:34,936 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 10:07:18,213 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-10 10:07:18,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Forcibly destroying the process [2018-11-10 10:07:19,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:07:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-10 10:07:19,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:07:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:07:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=45, Unknown=10, NotChecked=102, Total=182 [2018-11-10 10:07:19,525 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-11-10 10:07:22,628 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 10:07:25,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:07:28,210 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:07:30,650 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:07:32,873 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:07:35,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x~0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:07:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:40,168 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-10 10:07:40,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:07:40,168 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-10 10:07:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:40,169 INFO L225 Difference]: With dead ends: 19 [2018-11-10 10:07:40,169 INFO L226 Difference]: Without dead ends: 16 [2018-11-10 10:07:40,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=37, Invalid=51, Unknown=16, NotChecked=276, Total=380 [2018-11-10 10:07:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-10 10:07:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 10:07:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 10:07:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-10 10:07:40,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-10 10:07:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:40,174 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-10 10:07:40,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:07:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-10 10:07:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:07:40,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:40,174 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:07:40,175 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:40,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2018-11-10 10:07:40,175 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:07:40,175 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-10 10:07:40,178 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-10 10:07:41,874 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-10 10:07:41,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:07:41,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:08:03,317 WARN L179 SmtUtils]: Spent 6.76 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 10:08:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:03,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:08:10,059 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from false [2018-11-10 10:08:12,285 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from true [2018-11-10 10:08:14,729 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:08:17,181 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:08:19,853 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:08:22,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:08:25,430 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:08:28,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:08:31,453 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:08:34,582 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:08:37,968 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:08:41,305 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:08:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-11-10 10:08:41,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:08:41,358 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:08:41,364 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 10:09:19,735 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-10 10:09:19,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Forcibly destroying the process [2018-11-10 10:09:21,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:09:21,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-10 10:09:21,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 10:09:21,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 10:09:21,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=84, Unknown=18, NotChecked=138, Total=272 [2018-11-10 10:09:21,213 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-11-10 10:09:24,591 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)) (let ((.cse2 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (or (fp.eq .cse2 .cse1) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse2) .cse0)) .cse2)))))) is different from true [2018-11-10 10:09:27,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:09:30,722 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:09:33,423 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-11-10 10:09:35,899 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)))))) is different from true [2018-11-10 10:09:38,142 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:09:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:09:44,334 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-10 10:09:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:09:44,335 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-11-10 10:09:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:09:44,335 INFO L225 Difference]: With dead ends: 20 [2018-11-10 10:09:44,335 INFO L226 Difference]: Without dead ends: 17 [2018-11-10 10:09:44,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.2s TimeCoverageRelationStatistics Valid=44, Invalid=90, Unknown=24, NotChecked=348, Total=506 [2018-11-10 10:09:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-10 10:09:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 10:09:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 10:09:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-10 10:09:44,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-10 10:09:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:09:44,343 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-10 10:09:44,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 10:09:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-10 10:09:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 10:09:44,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:09:44,344 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:09:44,344 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:09:44,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:44,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2018-11-10 10:09:44,345 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:09:44,345 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-10 10:09:44,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:09:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:46,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:09:48,713 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-11-10 10:09:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-11-10 10:09:48,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:09:50,981 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from false [2018-11-10 10:09:53,216 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) is different from true [2018-11-10 10:09:55,684 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:09:58,140 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:10:00,842 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:10:03,539 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:10:06,462 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:10:09,406 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:10:12,604 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:10:15,771 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:10:19,159 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:10:22,589 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:10:25,963 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-11-10 10:10:29,362 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-11-10 10:10:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2018-11-10 10:10:29,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:10:29,417 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:10:29,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:10:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Forcibly destroying the process [2018-11-10 10:10:43,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:10:43,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-10 10:10:43,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 10:10:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 10:10:43,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=15, NotChecked=184, Total=306 [2018-11-10 10:10:43,081 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 18 states. [2018-11-10 10:10:46,487 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 10:10:49,940 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:10:53,129 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 10:10:56,075 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 10:10:58,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-11-10 10:11:01,270 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-11-10 10:11:03,515 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-11-10 10:11:05,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-11-10 10:11:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:11:17,120 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-10 10:11:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:11:17,121 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-11-10 10:11:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:11:17,121 INFO L225 Difference]: With dead ends: 21 [2018-11-10 10:11:17,121 INFO L226 Difference]: Without dead ends: 18 [2018-11-10 10:11:17,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.6s TimeCoverageRelationStatistics Valid=49, Invalid=82, Unknown=23, NotChecked=496, Total=650 [2018-11-10 10:11:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-10 10:11:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 10:11:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 10:11:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-10 10:11:17,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-10 10:11:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:11:17,128 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-10 10:11:17,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 10:11:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-10 10:11:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:11:17,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:11:17,130 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:11:17,130 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:11:17,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:11:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 8 times [2018-11-10 10:11:17,130 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:11:17,130 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44807e1-8bb7-4107-bf3d-2ab40fdebb74/bin-2019/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-11-10 10:11:17,134 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 10:11:19,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:11:19,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:11:19,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:11:21,809 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-11-10 10:11:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-11-10 10:11:21,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:11:24,113 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from false [2018-11-10 10:11:28,088 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:11:30,559 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:11:33,256 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:11:35,960 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:11:38,909 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:11:41,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:11:45,030 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:11:48,192 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:11:51,602 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:11:54,991 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:11:58,402 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-11-10 10:12:01,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-11-10 10:12:03,803 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-10 10:12:04,003 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2018-11-10 10:12:04,004 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-10 10:12:04,006 INFO L168 Benchmark]: Toolchain (without parser) took 594129.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -232.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:12:04,007 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:12:04,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.02 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:04,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.89 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:12:04,008 INFO L168 Benchmark]: Boogie Preprocessor took 15.31 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:04,008 INFO L168 Benchmark]: RCFGBuilder took 2366.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:04,009 INFO L168 Benchmark]: TraceAbstraction took 591580.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -57.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:04,011 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.02 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.89 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.31 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2366.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 591580.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -57.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...