./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f011cae72478203405f42ef6464e03fdd2e10cc0b39ba03a47237381f0057 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:41,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:41,696 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:53:41,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:41,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:41,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:41,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:41,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:41,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:41,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:41,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:41,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:41,755 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:41,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:41,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:41,757 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:41,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:41,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:41,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:41,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:41,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:41,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:41,761 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:41,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:41,763 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:41,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:41,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:41,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:41,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:41,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:41,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:41,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:41,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:41,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:41,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:41,769 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:41,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:41,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:41,771 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:41,772 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_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f011cae72478203405f42ef6464e03fdd2e10cc0b39ba03a47237381f0057 [2023-11-06 21:53:42,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:42,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:42,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:42,072 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:42,072 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:42,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i [2023-11-06 21:53:45,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:45,509 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:45,510 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i [2023-11-06 21:53:45,525 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/data/454a89f01/40a3f8dc345c42878fb25c50fb794cad/FLAG74ee580d4 [2023-11-06 21:53:45,539 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/data/454a89f01/40a3f8dc345c42878fb25c50fb794cad [2023-11-06 21:53:45,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:45,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:45,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:45,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:45,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:45,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180b5289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45, skipping insertion in model container [2023-11-06 21:53:45,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:45,766 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_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i[916,929] [2023-11-06 21:53:45,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:45,826 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:45,839 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_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i[916,929] [2023-11-06 21:53:45,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:45,898 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:45,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45 WrapperNode [2023-11-06 21:53:45,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:45,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:45,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:45,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:45,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,967 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-11-06 21:53:45,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:45,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:45,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:45,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:45,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:45,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:46,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:46,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:46,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:46,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:46,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:46,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (1/1) ... [2023-11-06 21:53:46,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:46,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:46,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:46,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:46,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:46,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:46,236 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:46,239 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:46,586 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:46,593 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:46,593 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:53:46,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:46 BoogieIcfgContainer [2023-11-06 21:53:46,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:46,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:46,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:46,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:46,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:45" (1/3) ... [2023-11-06 21:53:46,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae8a704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:46, skipping insertion in model container [2023-11-06 21:53:46,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:45" (2/3) ... [2023-11-06 21:53:46,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae8a704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:46, skipping insertion in model container [2023-11-06 21:53:46,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:46" (3/3) ... [2023-11-06 21:53:46,607 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-48.i [2023-11-06 21:53:46,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:46,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:53:46,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:46,695 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2bf4e9af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:46,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:53:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 21:53:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 21:53:46,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:46,720 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:46,720 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:46,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash -403830734, now seen corresponding path program 1 times [2023-11-06 21:53:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:46,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337562183] [2023-11-06 21:53:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:53:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:53:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:53:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:53:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:53:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:53:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:53:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:53:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:53:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:53:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:53:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:53:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:53:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:53:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:53:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:53:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:53:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-06 21:53:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337562183] [2023-11-06 21:53:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337562183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:47,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:47,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208068821] [2023-11-06 21:53:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:47,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:47,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:47,945 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-06 21:53:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:48,043 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2023-11-06 21:53:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:48,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 156 [2023-11-06 21:53:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:48,066 INFO L225 Difference]: With dead ends: 121 [2023-11-06 21:53:48,067 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 21:53:48,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:48,081 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:48,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 21:53:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-06 21:53:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 21:53:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2023-11-06 21:53:48,143 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 156 [2023-11-06 21:53:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:48,146 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2023-11-06 21:53:48,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-06 21:53:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2023-11-06 21:53:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 21:53:48,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:48,153 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:48,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:53:48,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:48,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:48,155 INFO L85 PathProgramCache]: Analyzing trace with hash -346572432, now seen corresponding path program 1 times [2023-11-06 21:53:48,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:48,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7649307] [2023-11-06 21:53:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:48,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:53:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:53:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:53:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:53:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:53:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:53:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:53:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:53:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:53:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:53:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:53:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:53:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:53:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:53:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:53:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:53:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:53:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-06 21:53:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7649307] [2023-11-06 21:53:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7649307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:51,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:51,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:53:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758864021] [2023-11-06 21:53:51,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:51,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:53:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:51,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:53:51,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:51,380 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-06 21:53:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:51,968 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2023-11-06 21:53:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:53:51,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 156 [2023-11-06 21:53:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:51,973 INFO L225 Difference]: With dead ends: 137 [2023-11-06 21:53:51,973 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 21:53:51,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:53:51,975 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 108 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:51,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 650 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:53:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 21:53:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2023-11-06 21:53:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 21:53:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2023-11-06 21:53:52,014 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 156 [2023-11-06 21:53:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:52,015 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2023-11-06 21:53:52,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-06 21:53:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2023-11-06 21:53:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-06 21:53:52,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:52,019 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:52,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:53:52,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:52,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1907443250, now seen corresponding path program 1 times [2023-11-06 21:53:52,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:52,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36313596] [2023-11-06 21:53:52,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:53:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:53:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:53:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:53:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:53:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:53:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:53:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:53:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:53:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:53:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:53:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:53:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:53:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:53:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:53:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:53:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:53:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-06 21:53:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36313596] [2023-11-06 21:53:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36313596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:56,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:53:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969804684] [2023-11-06 21:53:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:56,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:53:56,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:53:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:53:56,007 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-06 21:53:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:57,241 INFO L93 Difference]: Finished difference Result 135 states and 198 transitions. [2023-11-06 21:53:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:53:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 157 [2023-11-06 21:53:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:57,243 INFO L225 Difference]: With dead ends: 135 [2023-11-06 21:53:57,243 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 21:53:57,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:53:57,247 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 61 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:57,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 749 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:53:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 21:53:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 21:53:57,249 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-06 21:53:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 21:53:57,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2023-11-06 21:53:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:57,250 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 21:53:57,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-06 21:53:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 21:53:57,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 21:53:57,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:53:57,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:53:57,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 21:53:57,896 INFO L902 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: true [2023-11-06 21:53:57,897 INFO L902 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: true [2023-11-06 21:53:57,897 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 21:53:57,897 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 21:53:57,898 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse2 (= (* (div ~var_1_16~0 256) 256) ~var_1_16~0)) (.cse1 (* (div ~var_1_7~0 256) 256)) (.cse4 (+ (* 256 (div ~var_1_15~0 256)) ~var_1_14~0)) (.cse3 (* 256 (div ~var_1_14~0 256)))) (and (= ~var_1_1~0 ~var_1_6~0) (= ~var_1_16~0 ~var_1_19~0) (not (= |ULTIMATE.start_property_#res#1| 0)) (or (let ((.cse0 (* 255 ~var_1_15~0))) (= (+ .cse0 .cse1 ~var_1_12~0 ~var_1_11~0) (+ ~var_1_7~0 (* 256 (div (+ .cse0 ~var_1_12~0 ~var_1_11~0) 256))))) .cse2 (< (+ .cse3 ~var_1_15~0) .cse4)) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (or .cse2 (let ((.cse5 (* 255 ~var_1_14~0))) (= (+ (* (div (+ .cse5 ~var_1_12~0 ~var_1_11~0) 256) 256) ~var_1_7~0) (+ .cse5 .cse1 ~var_1_12~0 ~var_1_11~0))) (< .cse4 (+ .cse3 ~var_1_15~0 1))) (= (+ (* 256 (div ~var_1_17~0 256)) ~var_1_21~0) ~var_1_17~0) (= ~var_1_22~0 (+ (* 256 (div ~var_1_22~0 256)) 4)) (<= ~var_1_22~0 4) (= (+ .cse3 ~var_1_20~0) ~var_1_14~0))) [2023-11-06 21:53:57,898 INFO L899 garLoopResultBuilder]: For program point L110(lines 71 111) no Hoare annotation was computed. [2023-11-06 21:53:57,898 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-06 21:53:57,899 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 70) no Hoare annotation was computed. [2023-11-06 21:53:57,899 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 119 130) the Hoare annotation is: false [2023-11-06 21:53:57,899 INFO L902 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: true [2023-11-06 21:53:57,900 INFO L902 garLoopResultBuilder]: At program point L94-1(line 94) the Hoare annotation is: true [2023-11-06 21:53:57,900 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 21:53:57,900 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-11-06 21:53:57,900 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-11-06 21:53:57,900 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 53) no Hoare annotation was computed. [2023-11-06 21:53:57,900 INFO L902 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: true [2023-11-06 21:53:57,901 INFO L902 garLoopResultBuilder]: At program point L103-1(line 103) the Hoare annotation is: true [2023-11-06 21:53:57,901 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2023-11-06 21:53:57,901 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 114) no Hoare annotation was computed. [2023-11-06 21:53:57,901 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-11-06 21:53:57,901 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-11-06 21:53:57,901 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-06 21:53:57,902 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 21:53:57,902 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2023-11-06 21:53:57,902 INFO L902 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: true [2023-11-06 21:53:57,903 INFO L902 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: true [2023-11-06 21:53:57,903 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-06 21:53:57,904 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2023-11-06 21:53:57,904 INFO L902 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: true [2023-11-06 21:53:57,904 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 68) no Hoare annotation was computed. [2023-11-06 21:53:57,904 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-11-06 21:53:57,904 INFO L902 garLoopResultBuilder]: At program point L122-2(lines 122 128) the Hoare annotation is: true [2023-11-06 21:53:57,907 INFO L899 garLoopResultBuilder]: For program point L122-3(lines 122 128) no Hoare annotation was computed. [2023-11-06 21:53:57,911 INFO L902 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: true [2023-11-06 21:53:57,912 INFO L902 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: true [2023-11-06 21:53:57,915 INFO L902 garLoopResultBuilder]: At program point L106-1(line 106) the Hoare annotation is: true [2023-11-06 21:53:57,916 INFO L902 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: true [2023-11-06 21:53:57,917 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2023-11-06 21:53:57,917 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 21:53:57,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 21:53:57,917 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-11-06 21:53:57,917 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-11-06 21:53:57,918 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 115 118) the Hoare annotation is: (let ((.cse10 (* 256 (div ~var_1_14~0 256)))) (let ((.cse0 (= ~var_1_1~0 ~var_1_6~0)) (.cse1 (= ~var_1_16~0 ~var_1_19~0)) (.cse2 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse3 (= (+ (* 256 (div ~var_1_17~0 256)) ~var_1_21~0) ~var_1_17~0)) (.cse4 (= ~var_1_22~0 (+ (* 256 (div ~var_1_22~0 256)) 4))) (.cse5 (<= ~var_1_22~0 4)) (.cse6 (= (+ .cse10 ~var_1_20~0) ~var_1_14~0))) (or (and .cse0 .cse1 .cse2 (= (* (div ~var_1_16~0 256) 256) ~var_1_16~0) .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (* (div ~var_1_7~0 256) 256)) (.cse9 (+ (* 256 (div ~var_1_15~0 256)) ~var_1_14~0))) (and .cse0 (or (let ((.cse7 (* 255 ~var_1_14~0))) (= (+ (* (div (+ .cse7 ~var_1_12~0 ~var_1_11~0) 256) 256) ~var_1_7~0) (+ .cse7 .cse8 ~var_1_12~0 ~var_1_11~0))) (< .cse9 (+ .cse10 ~var_1_15~0 1))) .cse1 .cse2 (or (let ((.cse11 (* 255 ~var_1_15~0))) (= (+ .cse11 .cse8 ~var_1_12~0 ~var_1_11~0) (+ ~var_1_7~0 (* 256 (div (+ .cse11 ~var_1_12~0 ~var_1_11~0) 256))))) (< (+ .cse10 ~var_1_15~0) .cse9)) .cse3 .cse4 .cse5 .cse6))))) [2023-11-06 21:53:57,918 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2023-11-06 21:53:57,918 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-06 21:53:57,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 21:53:57,919 INFO L902 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: true [2023-11-06 21:53:57,919 INFO L902 garLoopResultBuilder]: At program point L91-1(line 91) the Hoare annotation is: true [2023-11-06 21:53:57,919 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 62) no Hoare annotation was computed. [2023-11-06 21:53:57,919 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 44 70) no Hoare annotation was computed. [2023-11-06 21:53:57,920 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-11-06 21:53:57,920 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 43) no Hoare annotation was computed. [2023-11-06 21:53:57,920 INFO L902 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: true [2023-11-06 21:53:57,920 INFO L902 garLoopResultBuilder]: At program point L100-1(line 100) the Hoare annotation is: true [2023-11-06 21:53:57,920 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2023-11-06 21:53:57,921 INFO L902 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: true [2023-11-06 21:53:57,921 INFO L902 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: true [2023-11-06 21:53:57,921 INFO L902 garLoopResultBuilder]: At program point L109-1(line 109) the Hoare annotation is: true [2023-11-06 21:53:57,921 INFO L902 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: true [2023-11-06 21:53:57,922 INFO L899 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2023-11-06 21:53:57,922 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 21:53:57,922 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 21:53:57,922 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 21:53:57,922 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 21:53:57,926 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 21:53:57,929 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:53:57,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:53:57 BoogieIcfgContainer [2023-11-06 21:53:57,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:53:57,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:53:57,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:53:57,978 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:53:57,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:46" (3/4) ... [2023-11-06 21:53:57,980 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 21:53:57,986 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 21:53:57,998 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 21:53:57,999 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 21:53:57,999 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 21:53:58,000 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 21:53:58,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((var_1_1 == var_1_6) && (var_1_16 == var_1_19)) && !((\result == 0))) && (((var_1_16 / 256) * 256) == var_1_16)) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14)) || (((((((((var_1_1 == var_1_6) && ((((((((255 * var_1_14) + var_1_12) + var_1_11) / 256) * 256) + var_1_7) == ((((255 * var_1_14) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11)) || (((256 * (var_1_15 / 256)) + var_1_14) < (((256 * (var_1_14 / 256)) + var_1_15) + 1)))) && (var_1_16 == var_1_19)) && !((\result == 0))) && ((((((255 * var_1_15) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11) == (var_1_7 + (256 * ((((255 * var_1_15) + var_1_12) + var_1_11) / 256)))) || (((256 * (var_1_14 / 256)) + var_1_15) < ((256 * (var_1_15 / 256)) + var_1_14)))) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14))) [2023-11-06 21:53:58,040 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((var_1_1 == var_1_6) && (var_1_16 == var_1_19)) && !((\result == 0))) && (((((((255 * var_1_15) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11) == (var_1_7 + (256 * ((((255 * var_1_15) + var_1_12) + var_1_11) / 256)))) || (((var_1_16 / 256) * 256) == var_1_16)) || (((256 * (var_1_14 / 256)) + var_1_15) < ((256 * (var_1_15 / 256)) + var_1_14)))) && !((cond == 0))) && (((((var_1_16 / 256) * 256) == var_1_16) || (((((((255 * var_1_14) + var_1_12) + var_1_11) / 256) * 256) + var_1_7) == ((((255 * var_1_14) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11))) || (((256 * (var_1_15 / 256)) + var_1_14) < (((256 * (var_1_14 / 256)) + var_1_15) + 1)))) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14)) [2023-11-06 21:53:58,087 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((var_1_1 == var_1_6) && (var_1_16 == var_1_19)) && !((\result == 0))) && (((var_1_16 / 256) * 256) == var_1_16)) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14)) || (((((((((var_1_1 == var_1_6) && ((((((((255 * var_1_14) + var_1_12) + var_1_11) / 256) * 256) + var_1_7) == ((((255 * var_1_14) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11)) || (((256 * (var_1_15 / 256)) + var_1_14) < (((256 * (var_1_14 / 256)) + var_1_15) + 1)))) && (var_1_16 == var_1_19)) && !((\result == 0))) && ((((((255 * var_1_15) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11) == (var_1_7 + (256 * ((((255 * var_1_15) + var_1_12) + var_1_11) / 256)))) || (((256 * (var_1_14 / 256)) + var_1_15) < ((256 * (var_1_15 / 256)) + var_1_14)))) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14))) [2023-11-06 21:53:58,087 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((var_1_1 == var_1_6) && (var_1_16 == var_1_19)) && !((\result == 0))) && (((((((255 * var_1_15) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11) == (var_1_7 + (256 * ((((255 * var_1_15) + var_1_12) + var_1_11) / 256)))) || (((var_1_16 / 256) * 256) == var_1_16)) || (((256 * (var_1_14 / 256)) + var_1_15) < ((256 * (var_1_15 / 256)) + var_1_14)))) && !((cond == 0))) && (((((var_1_16 / 256) * 256) == var_1_16) || (((((((255 * var_1_14) + var_1_12) + var_1_11) / 256) * 256) + var_1_7) == ((((255 * var_1_14) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11))) || (((256 * (var_1_15 / 256)) + var_1_14) < (((256 * (var_1_14 / 256)) + var_1_15) + 1)))) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14)) [2023-11-06 21:53:58,100 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:53:58,100 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 21:53:58,100 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:53:58,101 INFO L158 Benchmark]: Toolchain (without parser) took 12557.39ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 120.5MB in the beginning and 101.2MB in the end (delta: 19.3MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2023-11-06 21:53:58,102 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 157.3MB. Free memory was 132.4MB in the beginning and 132.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:58,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.31ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 107.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 21:53:58,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.04ms. Allocated memory is still 157.3MB. Free memory was 107.5MB in the beginning and 104.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:53:58,103 INFO L158 Benchmark]: Boogie Preprocessor took 36.38ms. Allocated memory is still 157.3MB. Free memory was 104.6MB in the beginning and 102.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:58,105 INFO L158 Benchmark]: RCFGBuilder took 591.08ms. Allocated memory is still 157.3MB. Free memory was 102.9MB in the beginning and 84.5MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 21:53:58,106 INFO L158 Benchmark]: TraceAbstraction took 11377.08ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 83.6MB in the beginning and 106.5MB in the end (delta: -22.9MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:58,110 INFO L158 Benchmark]: Witness Printer took 123.39ms. Allocated memory is still 226.5MB. Free memory was 106.5MB in the beginning and 101.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 21:53:58,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 157.3MB. Free memory was 132.4MB in the beginning and 132.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.31ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 107.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.04ms. Allocated memory is still 157.3MB. Free memory was 107.5MB in the beginning and 104.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.38ms. Allocated memory is still 157.3MB. Free memory was 104.6MB in the beginning and 102.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.08ms. Allocated memory is still 157.3MB. Free memory was 102.9MB in the beginning and 84.5MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11377.08ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 83.6MB in the beginning and 106.5MB in the end (delta: -22.9MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 123.39ms. Allocated memory is still 226.5MB. Free memory was 106.5MB in the beginning and 101.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 - 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, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 1563 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1167 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 396 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=2, InterpolantAutomatonStates: 33, 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, 55 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 116 PreInvPairs, 183 NumberOfFragments, 340 HoareAnnotationTreeSize, 116 FomulaSimplifications, 1757 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 31 FomulaSimplificationsInter, 1056 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 466 ConstructedInterpolants, 0 QuantifiedInterpolants, 882 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 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: 119]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((var_1_1 == var_1_6) && (var_1_16 == var_1_19)) && !((\result == 0))) && (((var_1_16 / 256) * 256) == var_1_16)) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14)) || (((((((((var_1_1 == var_1_6) && ((((((((255 * var_1_14) + var_1_12) + var_1_11) / 256) * 256) + var_1_7) == ((((255 * var_1_14) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11)) || (((256 * (var_1_15 / 256)) + var_1_14) < (((256 * (var_1_14 / 256)) + var_1_15) + 1)))) && (var_1_16 == var_1_19)) && !((\result == 0))) && ((((((255 * var_1_15) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11) == (var_1_7 + (256 * ((((255 * var_1_15) + var_1_12) + var_1_11) / 256)))) || (((256 * (var_1_14 / 256)) + var_1_15) < ((256 * (var_1_15 / 256)) + var_1_14)))) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14))) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((((var_1_1 == var_1_6) && (var_1_16 == var_1_19)) && !((\result == 0))) && (((((((255 * var_1_15) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11) == (var_1_7 + (256 * ((((255 * var_1_15) + var_1_12) + var_1_11) / 256)))) || (((var_1_16 / 256) * 256) == var_1_16)) || (((256 * (var_1_14 / 256)) + var_1_15) < ((256 * (var_1_15 / 256)) + var_1_14)))) && !((cond == 0))) && (((((var_1_16 / 256) * 256) == var_1_16) || (((((((255 * var_1_14) + var_1_12) + var_1_11) / 256) * 256) + var_1_7) == ((((255 * var_1_14) + ((var_1_7 / 256) * 256)) + var_1_12) + var_1_11))) || (((256 * (var_1_15 / 256)) + var_1_14) < (((256 * (var_1_14 / 256)) + var_1_15) + 1)))) && (((256 * (var_1_17 / 256)) + var_1_21) == var_1_17)) && (var_1_22 == ((256 * (var_1_22 / 256)) + 4))) && (var_1_22 <= 4)) && (((256 * (var_1_14 / 256)) + var_1_20) == var_1_14)) RESULT: Ultimate proved your program to be correct! [2023-11-06 21:53:58,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddd2f84-741e-4b02-aee3-ebbc21d5360c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE