./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:06:54,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:06:54,472 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:06:54,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:06:54,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:06:54,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:06:54,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:06:54,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:06:54,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:06:54,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:06:54,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:06:54,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:06:54,530 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:06:54,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:06:54,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:06:54,532 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:06:54,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:06:54,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:06:54,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:06:54,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:06:54,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:06:54,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:06:54,536 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:06:54,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:06:54,537 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:06:54,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:06:54,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:06:54,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:06:54,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:06:54,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:06:54,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:06:54,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:06:54,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:06:54,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:06:54,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:06:54,543 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:06:54,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:06:54,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:06:54,544 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:06:54,544 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a [2023-11-06 23:06:54,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:06:54,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:06:54,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:06:54,933 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:06:54,934 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:06:54,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2023-11-06 23:06:57,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:06:58,242 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:06:58,243 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2023-11-06 23:06:58,251 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/data/e6fca96ef/a0cd13bf00054e9bb5d65226401d0f55/FLAGeb1c33290 [2023-11-06 23:06:58,579 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/data/e6fca96ef/a0cd13bf00054e9bb5d65226401d0f55 [2023-11-06 23:06:58,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:06:58,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:06:58,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:06:58,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:06:58,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:06:58,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5497c0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58, skipping insertion in model container [2023-11-06 23:06:58,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,618 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:06:58,785 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2023-11-06 23:06:58,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:06:58,811 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:06:58,824 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2023-11-06 23:06:58,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:06:58,842 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:06:58,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58 WrapperNode [2023-11-06 23:06:58,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:06:58,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:06:58,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:06:58,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:06:58,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,877 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2023-11-06 23:06:58,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:06:58,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:06:58,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:06:58,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:06:58,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:06:58,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:06:58,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:06:58,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:06:58,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (1/1) ... [2023-11-06 23:06:58,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:06:58,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:58,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:06:58,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:06:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:06:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:06:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:06:58,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:06:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 23:06:58,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 23:06:59,044 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:06:59,046 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:06:59,216 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:06:59,230 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:06:59,230 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:06:59,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:06:59 BoogieIcfgContainer [2023-11-06 23:06:59,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:06:59,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:06:59,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:06:59,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:06:59,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:06:58" (1/3) ... [2023-11-06 23:06:59,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9764f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:06:59, skipping insertion in model container [2023-11-06 23:06:59,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:06:58" (2/3) ... [2023-11-06 23:06:59,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9764f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:06:59, skipping insertion in model container [2023-11-06 23:06:59,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:06:59" (3/3) ... [2023-11-06 23:06:59,243 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2023-11-06 23:06:59,264 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:06:59,264 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:06:59,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:06:59,313 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10db7b73, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:06:59,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:06:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:06:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:06:59,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:59,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:59,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:59,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2023-11-06 23:06:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000277646] [2023-11-06 23:06:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:59,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:59,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000277646] [2023-11-06 23:06:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000277646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:59,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:59,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:06:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718802877] [2023-11-06 23:06:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:59,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:06:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:06:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:06:59,541 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:59,561 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-11-06 23:06:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:06:59,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 23:06:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:59,571 INFO L225 Difference]: With dead ends: 33 [2023-11-06 23:06:59,571 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 23:06:59,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:06:59,578 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:59,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:06:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 23:06:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 23:06:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 23:06:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-06 23:06:59,617 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2023-11-06 23:06:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:59,617 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-06 23:06:59,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-06 23:06:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:06:59,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:59,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:59,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:06:59,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:59,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2023-11-06 23:06:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:59,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962588803] [2023-11-06 23:06:59,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:06:59,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:06:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:06:59,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:06:59,675 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:06:59,677 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:06:59,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:06:59,683 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-06 23:06:59,686 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:06:59,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:06:59 BoogieIcfgContainer [2023-11-06 23:06:59,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:06:59,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:06:59,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:06:59,705 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:06:59,706 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:06:59" (3/4) ... [2023-11-06 23:06:59,708 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:06:59,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:06:59,710 INFO L158 Benchmark]: Toolchain (without parser) took 1122.67ms. Allocated memory is still 136.3MB. Free memory was 102.0MB in the beginning and 54.8MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-06 23:06:59,711 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 136.3MB. Free memory was 108.0MB in the beginning and 108.0MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:06:59,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.55ms. Allocated memory is still 136.3MB. Free memory was 101.7MB in the beginning and 91.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 23:06:59,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.20ms. Allocated memory is still 136.3MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:06:59,712 INFO L158 Benchmark]: Boogie Preprocessor took 20.02ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 88.7MB in the end (delta: 991.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:06:59,713 INFO L158 Benchmark]: RCFGBuilder took 333.11ms. Allocated memory is still 136.3MB. Free memory was 88.7MB in the beginning and 79.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 23:06:59,713 INFO L158 Benchmark]: TraceAbstraction took 470.13ms. Allocated memory is still 136.3MB. Free memory was 78.6MB in the beginning and 55.2MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 23:06:59,714 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 136.3MB. Free memory was 55.2MB in the beginning and 54.8MB in the end (delta: 329.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:06:59,717 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 136.3MB. Free memory was 108.0MB in the beginning and 108.0MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.55ms. Allocated memory is still 136.3MB. Free memory was 101.7MB in the beginning and 91.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.20ms. Allocated memory is still 136.3MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.02ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 88.7MB in the end (delta: 991.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.11ms. Allocated memory is still 136.3MB. Free memory was 88.7MB in the beginning and 79.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 470.13ms. Allocated memory is still 136.3MB. Free memory was 78.6MB in the beginning and 55.2MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 136.3MB. Free memory was 55.2MB in the beginning and 54.8MB in the end (delta: 329.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=20) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=20) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:06:59,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:07:02,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:07:02,604 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 23:07:02,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:07:02,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:07:02,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:07:02,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:07:02,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:07:02,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:07:02,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:07:02,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:07:02,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:07:02,684 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:07:02,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:07:02,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:07:02,687 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:07:02,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:07:02,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:07:02,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:07:02,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:07:02,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:07:02,691 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:07:02,691 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:07:02,692 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:07:02,692 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:07:02,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:07:02,693 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:07:02,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:07:02,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:07:02,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:07:02,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:02,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:07:02,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:07:02,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:07:02,697 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:07:02,698 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:07:02,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:07:02,698 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:07:02,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:07:02,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:07:02,700 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:07:02,701 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:07:02,701 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a [2023-11-06 23:07:03,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:07:03,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:07:03,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:07:03,129 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:07:03,129 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:07:03,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2023-11-06 23:07:06,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:07:06,601 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:07:06,602 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2023-11-06 23:07:06,610 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/data/ec38ffd8e/934c305f355e43639ad0020dd7b0c0f5/FLAGc660ac7ba [2023-11-06 23:07:06,632 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/data/ec38ffd8e/934c305f355e43639ad0020dd7b0c0f5 [2023-11-06 23:07:06,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:07:06,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:07:06,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:06,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:07:06,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:07:06,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:06,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147c33b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06, skipping insertion in model container [2023-11-06 23:07:06,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:06,680 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:07:06,879 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2023-11-06 23:07:06,903 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:06,922 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:07:06,938 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2023-11-06 23:07:06,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:06,974 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:07:06,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06 WrapperNode [2023-11-06 23:07:06,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:06,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:06,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:07:06,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:07:06,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,029 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-11-06 23:07:07,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:07,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:07:07,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:07:07,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:07:07,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:07:07,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:07:07,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:07:07,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:07:07,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (1/1) ... [2023-11-06 23:07:07,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:07,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:07,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:07:07,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:07:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:07:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:07:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:07:07,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:07:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 23:07:07,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 23:07:07,260 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:07:07,262 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:07:08,319 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:07:08,325 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:07:08,326 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:07:08,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:08 BoogieIcfgContainer [2023-11-06 23:07:08,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:07:08,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:07:08,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:07:08,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:07:08,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:07:06" (1/3) ... [2023-11-06 23:07:08,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b52abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:08, skipping insertion in model container [2023-11-06 23:07:08,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:06" (2/3) ... [2023-11-06 23:07:08,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b52abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:08, skipping insertion in model container [2023-11-06 23:07:08,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:08" (3/3) ... [2023-11-06 23:07:08,338 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2023-11-06 23:07:08,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:07:08,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:07:08,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:07:08,425 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40bffdcf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:07:08,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:07:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:07:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:07:08,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:08,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:08,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:08,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2023-11-06 23:07:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:07:08,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897879956] [2023-11-06 23:07:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:08,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:07:08,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:07:08,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:07:08,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 23:07:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:08,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:07:08,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:07:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:08,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:07:08,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:07:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897879956] [2023-11-06 23:07:08,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897879956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:08,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:08,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:07:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107475300] [2023-11-06 23:07:08,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:08,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:07:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:07:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:07:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:07:08,959 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:08,981 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-11-06 23:07:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:07:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 23:07:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:08,991 INFO L225 Difference]: With dead ends: 33 [2023-11-06 23:07:08,991 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 23:07:08,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:07:08,999 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:09,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:07:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 23:07:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 23:07:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 23:07:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-06 23:07:09,037 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2023-11-06 23:07:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:09,037 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-06 23:07:09,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-06 23:07:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:07:09,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:09,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:09,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:07:09,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:07:09,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:09,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2023-11-06 23:07:09,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:07:09,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857357414] [2023-11-06 23:07:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:09,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:07:09,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:07:09,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:07:09,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 23:07:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:07:09,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:07:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:07:10,089 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2023-11-06 23:07:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1793391276] [2023-11-06 23:07:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:10,090 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 23:07:10,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 23:07:10,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 23:07:10,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-11-06 23:07:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:10,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 23:07:10,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:07:42,675 WARN L839 $PredicateComparison]: unable to prove that (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2023-11-06 23:08:18,742 WARN L293 SmtUtils]: Spent 12.17s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 23:08:32,556 WARN L839 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from false [2023-11-06 23:08:34,587 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from true [2023-11-06 23:08:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:34,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:34,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857357414] [2023-11-06 23:08:34,589 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:08:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793391276] [2023-11-06 23:08:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1793391276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:08:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582055456] [2023-11-06 23:08:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:34,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:08:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:08:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=24, Unknown=7, NotChecked=22, Total=72 [2023-11-06 23:08:34,593 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:36,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:41,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:42,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:08:44,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:08:46,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:08:48,767 WARN L839 $PredicateComparison]: unable to prove that (and (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))))))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-06 23:08:50,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:52,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:54,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:56,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:58,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:01,015 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))))) (and (or (= (_ bv1 32) c___VERIFIER_assert_~cond) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) .cse0)) .cse0)) is different from false [2023-11-06 23:09:03,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:05,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:08,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:10,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:12,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:14,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:16,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:18,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:20,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:22,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:24,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:26,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:28,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:30,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:33,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:35,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:37,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:39,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:42,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:44,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:46,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:48,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:09:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:48,173 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2023-11-06 23:09:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:09:48,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 23:09:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:48,242 INFO L225 Difference]: With dead ends: 24 [2023-11-06 23:09:48,242 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 23:09:48,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=28, Invalid=35, Unknown=9, NotChecked=60, Total=132 [2023-11-06 23:09:48,244 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 67.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:48,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 29 Unknown, 51 Unchecked, 67.8s Time] [2023-11-06 23:09:48,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 23:09:48,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-11-06 23:09:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:09:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-11-06 23:09:48,253 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 9 [2023-11-06 23:09:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:48,253 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-11-06 23:09:48,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-11-06 23:09:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 23:09:48,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:48,255 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:48,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:09:48,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:09:48,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt [2023-11-06 23:09:48,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:48,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2023-11-06 23:09:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:09:48,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824536674] [2023-11-06 23:09:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:48,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:09:48,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:09:48,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:09:48,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 23:09:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:49,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:09:49,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:09:55,366 WARN L839 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2023-11-06 23:09:57,423 WARN L861 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2023-11-06 23:10:09,813 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2023-11-06 23:10:18,092 WARN L839 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2023-11-06 23:10:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 23:10:18,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:10:39,132 WARN L293 SmtUtils]: Spent 12.63s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:10:51,779 WARN L293 SmtUtils]: Spent 12.65s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:10:58,036 WARN L861 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-11-06 23:11:08,480 WARN L861 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-11-06 23:11:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 23:11:08,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:08,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824536674] [2023-11-06 23:11:08,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824536674] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:11:08,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:11:08,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-11-06 23:11:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427189691] [2023-11-06 23:11:08,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:11:08,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:11:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:08,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:11:08,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2023-11-06 23:11:08,487 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 23:11:10,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:11:12,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 23:11:14,863 WARN L861 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2023-11-06 23:11:16,945 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) .cse0)) is different from true [2023-11-06 23:11:19,014 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2023-11-06 23:11:21,096 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from false [2023-11-06 23:11:23,165 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from true [2023-11-06 23:11:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:23,168 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2023-11-06 23:11:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:11:23,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-11-06 23:11:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:23,171 INFO L225 Difference]: With dead ends: 24 [2023-11-06 23:11:23,171 INFO L226 Difference]: Without dead ends: 19 [2023-11-06 23:11:23,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2023-11-06 23:11:23,173 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:23,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 92 Unchecked, 4.3s Time] [2023-11-06 23:11:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-06 23:11:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-06 23:11:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 23:11:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2023-11-06 23:11:23,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2023-11-06 23:11:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:23,182 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2023-11-06 23:11:23,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 23:11:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2023-11-06 23:11:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:11:23,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:11:23,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:23,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:23,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:23,388 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:11:23,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2023-11-06 23:11:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:23,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641478654] [2023-11-06 23:11:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:23,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:23,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:23,391 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:23,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 23:11:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:11:24,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:11:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:11:25,055 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2023-11-06 23:11:25,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1074262390] [2023-11-06 23:11:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:25,055 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 23:11:25,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 23:11:25,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 23:11:25,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b965799-858f-4f27-90d1-7e9a2a7d9c7a/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-11-06 23:11:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:29,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 23:11:29,591 INFO L285 TraceCheckSpWp]: Computing forward predicates...