./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:42:56,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:42:56,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:42:56,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:42:56,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:42:56,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:42:56,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:42:56,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:42:56,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:42:56,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:42:56,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:42:56,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:42:56,506 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:42:56,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:42:56,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:42:56,509 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:42:56,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:42:56,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:42:56,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:42:56,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:42:56,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:42:56,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:42:56,513 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:42:56,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:42:56,513 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:42:56,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:42:56,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:42:56,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:42:56,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:56,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:42:56,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:42:56,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:42:56,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:42:56,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:42:56,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:42:56,535 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:42:56,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:42:56,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:42:56,536 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:42:56,537 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_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 [2023-11-19 07:42:56,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:42:56,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:42:56,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:42:56,877 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:42:56,878 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:42:56,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2023-11-19 07:43:00,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:43:00,365 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:43:00,366 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2023-11-19 07:43:00,374 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/data/f59a538bc/a1eac8bcdbb5456a8a78e82193313bfd/FLAG074435bbc [2023-11-19 07:43:00,389 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/data/f59a538bc/a1eac8bcdbb5456a8a78e82193313bfd [2023-11-19 07:43:00,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:43:00,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:43:00,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:00,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:43:00,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:43:00,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5287efe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00, skipping insertion in model container [2023-11-19 07:43:00,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,440 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:43:00,597 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_e558a941-ff39-4491-a42f-9e9b2083b960/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i[915,928] [2023-11-19 07:43:00,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:00,640 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:43:00,654 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_e558a941-ff39-4491-a42f-9e9b2083b960/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i[915,928] [2023-11-19 07:43:00,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:00,685 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:43:00,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00 WrapperNode [2023-11-19 07:43:00,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:00,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:00,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:43:00,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:43:00,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,730 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2023-11-19 07:43:00,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:00,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:43:00,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:43:00,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:43:00,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:43:00,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:43:00,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:43:00,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:43:00,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:43:00,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:43:00,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:43:00,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:43:00,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:43:00,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:43:00,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:43:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:43:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:43:00,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:43:00,974 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:43:00,977 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:43:01,221 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:43:01,230 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:43:01,231 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:43:01,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:01 BoogieIcfgContainer [2023-11-19 07:43:01,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:43:01,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:43:01,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:43:01,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:43:01,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:43:00" (1/3) ... [2023-11-19 07:43:01,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f6bfab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:01, skipping insertion in model container [2023-11-19 07:43:01,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (2/3) ... [2023-11-19 07:43:01,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f6bfab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:01, skipping insertion in model container [2023-11-19 07:43:01,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:01" (3/3) ... [2023-11-19 07:43:01,253 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2023-11-19 07:43:01,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:43:01,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:43:01,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:43:01,362 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7cb47710, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:43:01,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:43:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-19 07:43:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-19 07:43:01,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:01,381 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:01,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:01,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash -207245000, now seen corresponding path program 1 times [2023-11-19 07:43:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:01,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660398341] [2023-11-19 07:43:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:43:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:43:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:43:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:43:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:43:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:43:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:43:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:43:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:43:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 07:43:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:43:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:43:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:43:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-19 07:43:01,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660398341] [2023-11-19 07:43:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660398341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:01,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:43:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878992994] [2023-11-19 07:43:01,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:01,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:43:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:01,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:43:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:43:01,847 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-19 07:43:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:01,896 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2023-11-19 07:43:01,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:43:01,898 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2023-11-19 07:43:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:01,908 INFO L225 Difference]: With dead ends: 73 [2023-11-19 07:43:01,909 INFO L226 Difference]: Without dead ends: 36 [2023-11-19 07:43:01,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-19 07:43:01,922 INFO L413 NwaCegarLoop]: 49 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, 49 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-19 07:43:01,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:43:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-19 07:43:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-19 07:43:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-19 07:43:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2023-11-19 07:43:01,969 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 82 [2023-11-19 07:43:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:01,969 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2023-11-19 07:43:01,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-19 07:43:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2023-11-19 07:43:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-19 07:43:01,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:01,975 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:01,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:43:01,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:01,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2011384006, now seen corresponding path program 1 times [2023-11-19 07:43:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941599055] [2023-11-19 07:43:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:43:02,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:43:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:43:02,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:43:02,455 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:43:02,457 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:43:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:43:02,464 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 07:43:02,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:43:02,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:43:02 BoogieIcfgContainer [2023-11-19 07:43:02,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:43:02,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:43:02,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:43:02,585 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:43:02,585 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:01" (3/4) ... [2023-11-19 07:43:02,588 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:43:02,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:43:02,590 INFO L158 Benchmark]: Toolchain (without parser) took 2196.29ms. Allocated memory was 119.5MB in the beginning and 176.2MB in the end (delta: 56.6MB). Free memory was 80.0MB in the beginning and 97.4MB in the end (delta: -17.4MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2023-11-19 07:43:02,591 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 119.5MB. Free memory was 90.7MB in the beginning and 90.5MB in the end (delta: 178.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:43:02,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.18ms. Allocated memory is still 119.5MB. Free memory was 79.6MB in the beginning and 68.3MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:43:02,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.48ms. Allocated memory is still 119.5MB. Free memory was 68.3MB in the beginning and 66.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:43:02,593 INFO L158 Benchmark]: Boogie Preprocessor took 41.92ms. Allocated memory is still 119.5MB. Free memory was 66.6MB in the beginning and 65.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:43:02,593 INFO L158 Benchmark]: RCFGBuilder took 460.96ms. Allocated memory is still 119.5MB. Free memory was 65.3MB in the beginning and 53.3MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:43:02,594 INFO L158 Benchmark]: TraceAbstraction took 1339.19ms. Allocated memory was 119.5MB in the beginning and 176.2MB in the end (delta: 56.6MB). Free memory was 52.3MB in the beginning and 98.2MB in the end (delta: -45.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2023-11-19 07:43:02,595 INFO L158 Benchmark]: Witness Printer took 5.17ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 97.4MB in the end (delta: 882.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:43:02,598 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.24ms. Allocated memory is still 119.5MB. Free memory was 90.7MB in the beginning and 90.5MB in the end (delta: 178.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.18ms. Allocated memory is still 119.5MB. Free memory was 79.6MB in the beginning and 68.3MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.48ms. Allocated memory is still 119.5MB. Free memory was 68.3MB in the beginning and 66.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.92ms. Allocated memory is still 119.5MB. Free memory was 66.6MB in the beginning and 65.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 460.96ms. Allocated memory is still 119.5MB. Free memory was 65.3MB in the beginning and 53.3MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1339.19ms. Allocated memory was 119.5MB in the beginning and 176.2MB in the end (delta: 56.6MB). Free memory was 52.3MB in the beginning and 98.2MB in the end (delta: -45.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 5.17ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 97.4MB in the end (delta: 882.6kB). 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 someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 4; [L23] unsigned long int var_1_3 = 3854620897; [L24] unsigned long int var_1_4 = 1; [L25] unsigned long int var_1_5 = 5; [L26] unsigned long int var_1_6 = 1934698459; [L27] unsigned long int var_1_7 = 1000000000; [L28] unsigned long int var_1_8 = 0; [L29] unsigned long int var_1_9 = 16; [L30] double var_1_10 = 31.375; [L31] double var_1_11 = -0.6; VAL [isInitial=0, var_1_10=251/8, var_1_1=4, var_1_3=3854620897, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L43] var_1_3 = __VERIFIER_nondet_ulong() [L44] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L44] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L45] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L45] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L46] var_1_4 = __VERIFIER_nondet_ulong() [L47] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L47] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L48] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L48] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L49] var_1_5 = __VERIFIER_nondet_ulong() [L50] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L50] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L51] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L51] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L52] var_1_6 = __VERIFIER_nondet_ulong() [L53] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L53] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L54] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L54] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L55] var_1_7 = __VERIFIER_nondet_ulong() [L56] CALL assume_abort_if_not(var_1_7 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=0, var_1_9=16] [L56] RET assume_abort_if_not(var_1_7 >= 536870911) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=0, var_1_9=16] [L57] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=0, var_1_9=16] [L57] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=0, var_1_9=16] [L58] var_1_8 = __VERIFIER_nondet_ulong() [L59] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L59] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L60] CALL assume_abort_if_not(var_1_8 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L60] RET assume_abort_if_not(var_1_8 <= 536870911) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L61] var_1_11 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_11=9223372039002259460, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=251/8, var_1_11=9223372039002259460, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L62] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=251/8, var_1_11=9223372039002259460, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=16] [L75] RET updateVariables() [L76] CALL step() [L35] var_1_9 = var_1_7 [L36] var_1_10 = var_1_11 [L37] unsigned long int stepLocal_0 = var_1_9; VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=9223372039002259460, var_1_11=9223372039002259460, var_1_1=4, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=1073741823] [L38] COND TRUE stepLocal_0 >= (var_1_3 - ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) [L39] var_1_1 = (var_1_4 + (var_1_6 - (var_1_7 - var_1_8))) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=9223372039002259460, var_1_11=9223372039002259460, var_1_1=2147483651, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=1073741823] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return (((var_1_9 >= (var_1_3 - ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((unsigned long int) (var_1_4 + (var_1_6 - (var_1_7 - var_1_8))))) : 1) && (var_1_9 == ((unsigned long int) var_1_7))) && (var_1_10 == ((double) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=9223372039002259460, var_1_11=9223372039002259460, var_1_1=2147483651, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=1073741823] [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=9223372039002259460, var_1_11=9223372039002259460, var_1_1=2147483651, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=1073741823] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=9223372039002259460, var_1_11=9223372039002259460, var_1_1=2147483651, var_1_3=2147483647, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1073741823, var_1_7=1073741823, var_1_8=4, var_1_9=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 13, 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, 49 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, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 312/312 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-19 07:43:02,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:43:05,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:43:05,462 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:43:05,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:43:05,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:43:05,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:43:05,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:43:05,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:43:05,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:43:05,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:43:05,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:43:05,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:43:05,532 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:43:05,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:43:05,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:43:05,535 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:43:05,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:43:05,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:43:05,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:43:05,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:43:05,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:43:05,539 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:43:05,539 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:43:05,539 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:43:05,540 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:43:05,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:43:05,541 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:43:05,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:43:05,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:43:05,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:43:05,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:43:05,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:43:05,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:43:05,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:43:05,544 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:43:05,545 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:43:05,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:43:05,545 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:43:05,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:43:05,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:43:05,547 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:43:05,547 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:43:05,547 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_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 [2023-11-19 07:43:05,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:43:05,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:43:05,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:43:05,997 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:43:05,998 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:43:05,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2023-11-19 07:43:09,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:43:09,612 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:43:09,612 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2023-11-19 07:43:09,621 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/data/742fb35b7/dbf929f7d31e43a08e62cca3eb5f3cf8/FLAG84f179c72 [2023-11-19 07:43:09,635 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/data/742fb35b7/dbf929f7d31e43a08e62cca3eb5f3cf8 [2023-11-19 07:43:09,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:43:09,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:43:09,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:09,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:43:09,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:43:09,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a329bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09, skipping insertion in model container [2023-11-19 07:43:09,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,675 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:43:09,832 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_e558a941-ff39-4491-a42f-9e9b2083b960/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i[915,928] [2023-11-19 07:43:09,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:09,881 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:43:09,893 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_e558a941-ff39-4491-a42f-9e9b2083b960/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i[915,928] [2023-11-19 07:43:09,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:09,923 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:43:09,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09 WrapperNode [2023-11-19 07:43:09,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:09,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:09,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:43:09,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:43:09,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,966 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2023-11-19 07:43:09,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:09,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:43:09,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:43:09,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:43:09,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:10,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:10,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:43:10,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:43:10,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:43:10,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:43:10,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:10,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:43:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:43:10,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:43:10,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:43:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:43:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:43:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:43:10,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:43:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:43:10,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:43:10,172 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:43:10,174 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:43:10,422 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:43:10,431 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:43:10,431 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:43:10,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:10 BoogieIcfgContainer [2023-11-19 07:43:10,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:43:10,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:43:10,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:43:10,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:43:10,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:43:09" (1/3) ... [2023-11-19 07:43:10,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2367757e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:10, skipping insertion in model container [2023-11-19 07:43:10,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (2/3) ... [2023-11-19 07:43:10,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2367757e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:10, skipping insertion in model container [2023-11-19 07:43:10,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:10" (3/3) ... [2023-11-19 07:43:10,451 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2023-11-19 07:43:10,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:43:10,475 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:43:10,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:43:10,558 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f0280a7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:43:10,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:43:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-19 07:43:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-19 07:43:10,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:10,582 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:10,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:10,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash -207245000, now seen corresponding path program 1 times [2023-11-19 07:43:10,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:43:10,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999809880] [2023-11-19 07:43:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:10,617 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-19 07:43:10,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:43:10,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:10,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:43:10,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:43:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-19 07:43:10,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:43:10,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:43:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999809880] [2023-11-19 07:43:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999809880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:10,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:43:10,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820064301] [2023-11-19 07:43:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:10,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:43:10,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:43:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:43:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:43:10,983 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-19 07:43:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:11,012 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2023-11-19 07:43:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:43:11,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2023-11-19 07:43:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:11,029 INFO L225 Difference]: With dead ends: 73 [2023-11-19 07:43:11,029 INFO L226 Difference]: Without dead ends: 36 [2023-11-19 07:43:11,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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-19 07:43:11,039 INFO L413 NwaCegarLoop]: 49 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, 49 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-19 07:43:11,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:43:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-19 07:43:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-19 07:43:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-19 07:43:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2023-11-19 07:43:11,094 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 82 [2023-11-19 07:43:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:11,095 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2023-11-19 07:43:11,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-19 07:43:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2023-11-19 07:43:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-19 07:43:11,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:11,101 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:11,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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)] Ended with exit code 0 [2023-11-19 07:43:11,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:11,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:11,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2011384006, now seen corresponding path program 1 times [2023-11-19 07:43:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:43:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80849745] [2023-11-19 07:43:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:11,309 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-19 07:43:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:43:11,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:11,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:11,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-19 07:43:11,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:43:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-11-19 07:43:12,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:43:12,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:43:12,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80849745] [2023-11-19 07:43:12,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80849745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:12,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:12,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:43:12,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191321821] [2023-11-19 07:43:12,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:12,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:43:12,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:43:12,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:43:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:43:12,777 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:43:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:16,101 INFO L93 Difference]: Finished difference Result 99 states and 131 transitions. [2023-11-19 07:43:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-19 07:43:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2023-11-19 07:43:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:16,106 INFO L225 Difference]: With dead ends: 99 [2023-11-19 07:43:16,107 INFO L226 Difference]: Without dead ends: 97 [2023-11-19 07:43:16,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2023-11-19 07:43:16,109 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 80 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:16,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 240 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-19 07:43:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-19 07:43:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2023-11-19 07:43:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-19 07:43:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2023-11-19 07:43:16,141 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 82 [2023-11-19 07:43:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:16,142 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2023-11-19 07:43:16,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:43:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2023-11-19 07:43:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-19 07:43:16,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:16,145 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:16,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:16,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:16,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:16,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:16,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2009536964, now seen corresponding path program 1 times [2023-11-19 07:43:16,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:43:16,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964500996] [2023-11-19 07:43:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:16,352 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-19 07:43:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:43:16,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:16,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-19 07:43:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:16,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-19 07:43:16,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:43:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 174 proven. 12 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-19 07:43:18,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:43:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-11-19 07:43:22,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:43:22,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964500996] [2023-11-19 07:43:22,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964500996] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 07:43:22,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:43:22,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 23 [2023-11-19 07:43:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104032231] [2023-11-19 07:43:22,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:22,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:43:22,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:43:22,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:43:22,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2023-11-19 07:43:22,385 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:43:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:37,193 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2023-11-19 07:43:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:43:37,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2023-11-19 07:43:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:37,202 INFO L225 Difference]: With dead ends: 96 [2023-11-19 07:43:37,202 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:43:37,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2023-11-19 07:43:37,206 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:37,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 210 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2023-11-19 07:43:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:43:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:43:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:43:37,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-11-19 07:43:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:37,214 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:43:37,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-19 07:43:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:43:37,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:43:37,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:43:37,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:43:37,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:43:37,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:43:44,067 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2023-11-19 07:43:44,068 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-11-19 07:43:44,068 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,068 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,068 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-19 07:43:44,068 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-19 07:43:44,069 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-19 07:43:44,069 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-19 07:43:44,069 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,069 INFO L895 garLoopResultBuilder]: At program point L44-1(line 44) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,069 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 70 81) no Hoare annotation was computed. [2023-11-19 07:43:44,069 INFO L895 garLoopResultBuilder]: At program point L73-2(lines 73 79) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,070 INFO L899 garLoopResultBuilder]: For program point L73-3(lines 73 79) no Hoare annotation was computed. [2023-11-19 07:43:44,070 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 33) no Hoare annotation was computed. [2023-11-19 07:43:44,070 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:43:44,070 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:43:44,070 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-11-19 07:43:44,070 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-19 07:43:44,071 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,071 INFO L895 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,071 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 66 69) no Hoare annotation was computed. [2023-11-19 07:43:44,072 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-11-19 07:43:44,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:43:44,072 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-11-19 07:43:44,072 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 42 63) no Hoare annotation was computed. [2023-11-19 07:43:44,072 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2023-11-19 07:43:44,073 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,073 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,073 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:43:44,073 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-11-19 07:43:44,073 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 41) no Hoare annotation was computed. [2023-11-19 07:43:44,074 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,074 INFO L895 garLoopResultBuilder]: At program point L59-1(line 59) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,074 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-11-19 07:43:44,074 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,075 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-19 07:43:44,075 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-19 07:43:44,075 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-19 07:43:44,075 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-19 07:43:44,075 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-19 07:43:44,079 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-19 07:43:44,081 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:43:44,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-19 07:43:44,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-19 07:43:44,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-19 07:43:44,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-19 07:43:44,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-19 07:43:44,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:43:44 BoogieIcfgContainer [2023-11-19 07:43:44,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:43:44,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:43:44,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:43:44,097 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:43:44,097 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:10" (3/4) ... [2023-11-19 07:43:44,099 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:43:44,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-19 07:43:44,109 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-19 07:43:44,109 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-19 07:43:44,110 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:43:44,110 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:43:44,219 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:43:44,220 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:43:44,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:43:44,221 INFO L158 Benchmark]: Toolchain (without parser) took 34581.94ms. Allocated memory was 77.6MB in the beginning and 117.4MB in the end (delta: 39.8MB). Free memory was 53.7MB in the beginning and 80.5MB in the end (delta: -26.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2023-11-19 07:43:44,222 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:43:44,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.97ms. Allocated memory is still 77.6MB. Free memory was 53.5MB in the beginning and 41.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:43:44,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.95ms. Allocated memory is still 77.6MB. Free memory was 41.6MB in the beginning and 39.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:43:44,223 INFO L158 Benchmark]: Boogie Preprocessor took 36.14ms. Allocated memory is still 77.6MB. Free memory was 39.9MB in the beginning and 38.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:43:44,223 INFO L158 Benchmark]: RCFGBuilder took 430.83ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 38.3MB in the beginning and 64.6MB in the end (delta: -26.3MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-11-19 07:43:44,224 INFO L158 Benchmark]: TraceAbstraction took 33657.52ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 63.9MB in the beginning and 85.8MB in the end (delta: -21.9MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2023-11-19 07:43:44,224 INFO L158 Benchmark]: Witness Printer took 123.89ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 80.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:43:44,228 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.26ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.97ms. Allocated memory is still 77.6MB. Free memory was 53.5MB in the beginning and 41.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.95ms. Allocated memory is still 77.6MB. Free memory was 41.6MB in the beginning and 39.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.14ms. Allocated memory is still 77.6MB. Free memory was 39.9MB in the beginning and 38.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 430.83ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 38.3MB in the beginning and 64.6MB in the end (delta: -26.3MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * TraceAbstraction took 33657.52ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 63.9MB in the beginning and 85.8MB in the end (delta: -21.9MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Witness Printer took 123.89ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 80.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.6s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 13.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 331 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 542 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 168 mSDtfsCounter, 542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 61 PreInvPairs, 98 NumberOfFragments, 485 HoareAnnotationTreeSize, 61 FomulaSimplifications, 30 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 4509 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 324 ConstructedInterpolants, 5 QuantifiedInterpolants, 1496 SizeOfPredicates, 40 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1236/1248 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-19 07:43:44,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e558a941-ff39-4491-a42f-9e9b2083b960/bin/uautomizer-verify-uCwYo4JHxu/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 Writing output log to file Ultimate.log Result: TRUE