./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.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_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/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_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/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_4b32fb2b-9b22-4153-88c4-a81edb712982/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 dba6b0ef25bae7761b43c0e245fa504288384a8042fc35bb9e63270387c5de2b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:49:29,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:49:29,099 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:49:29,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:49:29,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:49:29,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:49:29,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:49:29,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:49:29,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:49:29,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:49:29,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:49:29,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:49:29,167 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:49:29,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:49:29,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:49:29,174 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:49:29,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:49:29,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:49:29,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:49:29,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:49:29,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:49:29,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:49:29,180 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:49:29,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:49:29,181 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:49:29,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:49:29,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:49:29,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:49:29,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:29,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:49:29,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:49:29,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:49:29,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:49:29,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:49:29,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:49:29,188 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:49:29,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:49:29,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:49:29,189 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:49:29,189 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_4b32fb2b-9b22-4153-88c4-a81edb712982/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_4b32fb2b-9b22-4153-88c4-a81edb712982/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 -> dba6b0ef25bae7761b43c0e245fa504288384a8042fc35bb9e63270387c5de2b [2023-11-06 22:49:29,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:49:29,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:49:29,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:49:29,665 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:49:29,665 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:49:29,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i [2023-11-06 22:49:33,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:49:33,562 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:49:33,563 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i [2023-11-06 22:49:33,574 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/data/1dcab558f/b94c17cfbe644c9bb69b72af1c063abd/FLAG491de02ad [2023-11-06 22:49:33,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/data/1dcab558f/b94c17cfbe644c9bb69b72af1c063abd [2023-11-06 22:49:33,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:49:33,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:49:33,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:33,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:49:33,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:49:33,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:33,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0b4abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33, skipping insertion in model container [2023-11-06 22:49:33,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:33,643 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:49:33,854 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_4b32fb2b-9b22-4153-88c4-a81edb712982/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i[915,928] [2023-11-06 22:49:33,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:33,912 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:49:33,929 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_4b32fb2b-9b22-4153-88c4-a81edb712982/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i[915,928] [2023-11-06 22:49:33,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:33,971 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:49:33,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33 WrapperNode [2023-11-06 22:49:33,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:33,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:33,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:49:33,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:49:33,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,057 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2023-11-06 22:49:34,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:34,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:49:34,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:49:34,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:49:34,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:49:34,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:49:34,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:49:34,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:49:34,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (1/1) ... [2023-11-06 22:49:34,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:34,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:34,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:49:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:49:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:49:34,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:49:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:49:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:49:34,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:49:34,328 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:49:34,331 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:49:34,726 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:49:34,738 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:49:34,739 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:49:34,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:34 BoogieIcfgContainer [2023-11-06 22:49:34,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:49:34,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:49:34,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:49:34,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:49:34,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:49:33" (1/3) ... [2023-11-06 22:49:34,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49038d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:34, skipping insertion in model container [2023-11-06 22:49:34,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:33" (2/3) ... [2023-11-06 22:49:34,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49038d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:34, skipping insertion in model container [2023-11-06 22:49:34,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:34" (3/3) ... [2023-11-06 22:49:34,755 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-89.i [2023-11-06 22:49:34,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:49:34,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:49:34,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:49:34,852 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;@5d44abe4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:49:34,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:49:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:49:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:49:34,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:34,876 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:49:34,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:34,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2027876380, now seen corresponding path program 1 times [2023-11-06 22:49:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:34,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458520268] [2023-11-06 22:49:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:49:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:49:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:49:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:49:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:49:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:49:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:49:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:49:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:49:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:49:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:35,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458520268] [2023-11-06 22:49:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458520268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:35,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:35,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:49:35,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913655495] [2023-11-06 22:49:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:35,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:49:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:35,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:49:35,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:49:35,404 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:49:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:35,440 INFO L93 Difference]: Finished difference Result 69 states and 112 transitions. [2023-11-06 22:49:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:49:35,443 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2023-11-06 22:49:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:35,452 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:49:35,452 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 22:49:35,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:49:35,463 INFO L413 NwaCegarLoop]: 46 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, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:35,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 22:49:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-06 22:49:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:49:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2023-11-06 22:49:35,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 76 [2023-11-06 22:49:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:35,525 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2023-11-06 22:49:35,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:49:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2023-11-06 22:49:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:49:35,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:35,536 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:49:35,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:49:35,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:35,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1552619548, now seen corresponding path program 1 times [2023-11-06 22:49:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:35,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886810340] [2023-11-06 22:49:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:49:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:49:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:49:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:49:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:49:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:49:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:49:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:49:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:49:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:49:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886810340] [2023-11-06 22:49:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886810340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:37,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:49:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202482277] [2023-11-06 22:49:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:37,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:37,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:37,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:37,478 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:49:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:38,529 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2023-11-06 22:49:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:49:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2023-11-06 22:49:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:38,535 INFO L225 Difference]: With dead ends: 82 [2023-11-06 22:49:38,535 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:49:38,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:49:38,541 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 56 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:38,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 283 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:49:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:49:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2023-11-06 22:49:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:49:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2023-11-06 22:49:38,642 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 76 [2023-11-06 22:49:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:38,645 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2023-11-06 22:49:38,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:49:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2023-11-06 22:49:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:49:38,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:38,657 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:49:38,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:49:38,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:38,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1554466590, now seen corresponding path program 1 times [2023-11-06 22:49:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:38,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230947342] [2023-11-06 22:49:38,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:49:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:49:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:49:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:49:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:49:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:49:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:49:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:49:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:49:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:49:39,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:39,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230947342] [2023-11-06 22:49:39,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230947342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:39,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:49:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103257645] [2023-11-06 22:49:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:39,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:39,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:39,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:39,854 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:49:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:40,737 INFO L93 Difference]: Finished difference Result 79 states and 108 transitions. [2023-11-06 22:49:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:49:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2023-11-06 22:49:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:40,743 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:49:40,744 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:49:40,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:49:40,749 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:40,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 288 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:49:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:49:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:49:40,755 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 22:49:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:49:40,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-06 22:49:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:40,756 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:49:40,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:49:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:49:40,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:49:40,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:49:40,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:49:40,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:49:41,588 INFO L899 garLoopResultBuilder]: For program point L68-3(lines 68 74) no Hoare annotation was computed. [2023-11-06 22:49:41,588 INFO L902 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: true [2023-11-06 22:49:41,589 INFO L902 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: true [2023-11-06 22:49:41,589 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:49:41,589 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:49:41,590 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-06 22:49:41,596 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse17 (* 255 ~var_1_9~0))) (let ((.cse9 (+ .cse17 ~var_1_8~0 25)) (.cse4 (+ .cse17 ~var_1_7~0 25))) (let ((.cse3 (* 256 (div .cse4 256))) (.cse2 (+ .cse17 ~var_1_7~0)) (.cse10 (+ .cse17 ~var_1_8~0)) (.cse8 (* 256 (div .cse9 256)))) (let ((.cse12 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse13 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (.cse6 (= .cse10 (+ 231 ~var_1_6~0 .cse8))) (.cse11 (<= ~var_1_8~0 ~var_1_7~0)) (.cse7 (<= (+ 103 .cse8) .cse10)) (.cse0 (<= (+ .cse3 103) .cse2)) (.cse5 (<= (+ ~var_1_7~0 1) ~var_1_8~0)) (.cse1 (= (+ .cse3 231 ~var_1_6~0) .cse2))) (or (and (or (and (or (and .cse0 .cse1) (and (<= .cse2 (+ .cse3 102)) (= .cse4 (+ .cse3 ~var_1_6~0)))) .cse5) (and (or (and .cse6 .cse7) (and (= (+ ~var_1_6~0 .cse8) .cse9) (<= .cse10 (+ 102 .cse8)))) .cse11)) .cse12 .cse13 (let ((.cse14 (* (div ~var_1_4~0 65536) 65536))) (let ((.cse16 (+ .cse14 ~var_1_5~0)) (.cse15 (* (div ~var_1_5~0 65536) 65536))) (or (and (= ~var_1_4~0 (+ .cse14 ~var_1_1~0)) (<= (+ .cse15 ~var_1_4~0 1) .cse16)) (and (<= .cse16 (+ .cse15 ~var_1_4~0)) (= (+ .cse15 ~var_1_1~0) ~var_1_5~0)))))) (and (<= (+ ~var_1_6~0 50) 0) .cse12 .cse13 (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256))) (or (and .cse6 .cse11 .cse7) (and .cse0 .cse5 .cse1)))))))) [2023-11-06 22:49:41,597 INFO L902 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2023-11-06 22:49:41,597 INFO L902 garLoopResultBuilder]: At program point L44-1(line 44) the Hoare annotation is: true [2023-11-06 22:49:41,597 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 65 76) the Hoare annotation is: false [2023-11-06 22:49:41,597 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 38) no Hoare annotation was computed. [2023-11-06 22:49:41,598 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:49:41,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:49:41,598 INFO L899 garLoopResultBuilder]: For program point L57(lines 39 58) no Hoare annotation was computed. [2023-11-06 22:49:41,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:49:41,599 INFO L902 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2023-11-06 22:49:41,599 INFO L902 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: true [2023-11-06 22:49:41,601 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 61 64) the Hoare annotation is: (let ((.cse16 (* 255 ~var_1_9~0))) (let ((.cse9 (+ .cse16 ~var_1_7~0 25)) (.cse11 (+ .cse16 ~var_1_8~0 25))) (let ((.cse12 (+ .cse16 ~var_1_8~0)) (.cse10 (* 256 (div .cse11 256))) (.cse8 (* 256 (div .cse9 256))) (.cse7 (+ .cse16 ~var_1_7~0))) (let ((.cse4 (<= (+ .cse8 103) .cse7)) (.cse6 (= (+ .cse8 231 ~var_1_6~0) .cse7)) (.cse5 (<= (+ ~var_1_7~0 1) ~var_1_8~0)) (.cse1 (= .cse12 (+ 231 ~var_1_6~0 .cse10))) (.cse3 (<= (+ 103 .cse10) .cse12)) (.cse2 (<= ~var_1_8~0 ~var_1_7~0)) (.cse0 (not (= |ULTIMATE.start_property_#res#1| 0)))) (or (and (<= (+ ~var_1_6~0 50) 0) .cse0 (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256))) (or (and .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6))) (and (or (and (or (and .cse4 .cse6) (and (<= .cse7 (+ .cse8 102)) (= .cse9 (+ .cse8 ~var_1_6~0)))) .cse5) (and (or (and .cse1 .cse3) (and (= (+ ~var_1_6~0 .cse10) .cse11) (<= .cse12 (+ 102 .cse10)))) .cse2)) .cse0 (let ((.cse13 (* (div ~var_1_4~0 65536) 65536))) (let ((.cse15 (+ .cse13 ~var_1_5~0)) (.cse14 (* (div ~var_1_5~0 65536) 65536))) (or (and (= ~var_1_4~0 (+ .cse13 ~var_1_1~0)) (<= (+ .cse14 ~var_1_4~0 1) .cse15)) (and (<= .cse15 (+ .cse14 ~var_1_4~0)) (= (+ .cse14 ~var_1_1~0) ~var_1_5~0))))))))))) [2023-11-06 22:49:41,601 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-11-06 22:49:41,601 INFO L902 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2023-11-06 22:49:41,602 INFO L902 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: true [2023-11-06 22:49:41,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:49:41,602 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2023-11-06 22:49:41,603 INFO L902 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2023-11-06 22:49:41,603 INFO L902 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: true [2023-11-06 22:49:41,603 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2023-11-06 22:49:41,603 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:49:41,604 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 31) no Hoare annotation was computed. [2023-11-06 22:49:41,604 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2023-11-06 22:49:41,604 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-11-06 22:49:41,605 INFO L902 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: true [2023-11-06 22:49:41,606 INFO L902 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: true [2023-11-06 22:49:41,609 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-11-06 22:49:41,613 INFO L902 garLoopResultBuilder]: At program point L68-2(lines 68 74) the Hoare annotation is: true [2023-11-06 22:49:41,614 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:49:41,614 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:49:41,616 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:49:41,617 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:49:41,621 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 22:49:41,624 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:49:41,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:49:41 BoogieIcfgContainer [2023-11-06 22:49:41,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:49:41,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:49:41,699 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:49:41,700 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:49:41,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:34" (3/4) ... [2023-11-06 22:49:41,703 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:49:41,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:49:41,718 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:49:41,720 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:49:41,722 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:49:41,722 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:49:41,758 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((var_1_6 + 50) <= 0) && !((\result == 0))) && (var_1_3 == (256 * (var_1_3 / 256)))) && ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && (var_1_8 <= var_1_7)) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((var_1_7 + 1) <= var_1_8)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))))) || (((((((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))) || ((((255 * var_1_9) + var_1_7) <= ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 102)) && ((((255 * var_1_9) + var_1_7) + 25) == ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + var_1_6)))) && ((var_1_7 + 1) <= var_1_8)) || ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((var_1_6 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) == (((255 * var_1_9) + var_1_8) + 25)) && (((255 * var_1_9) + var_1_8) <= (102 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))))) && (var_1_8 <= var_1_7))) && !((\result == 0))) && (((var_1_4 == (((var_1_4 / 65536) * 65536) + var_1_1)) && (((((var_1_5 / 65536) * 65536) + var_1_4) + 1) <= (((var_1_4 / 65536) * 65536) + var_1_5))) || (((((var_1_4 / 65536) * 65536) + var_1_5) <= (((var_1_5 / 65536) * 65536) + var_1_4)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) [2023-11-06 22:49:41,760 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))) || ((((255 * var_1_9) + var_1_7) <= ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 102)) && ((((255 * var_1_9) + var_1_7) + 25) == ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + var_1_6)))) && ((var_1_7 + 1) <= var_1_8)) || ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((var_1_6 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) == (((255 * var_1_9) + var_1_8) + 25)) && (((255 * var_1_9) + var_1_8) <= (102 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))))) && (var_1_8 <= var_1_7))) && !((\result == 0))) && !((cond == 0))) && (((var_1_4 == (((var_1_4 / 65536) * 65536) + var_1_1)) && (((((var_1_5 / 65536) * 65536) + var_1_4) + 1) <= (((var_1_4 / 65536) * 65536) + var_1_5))) || (((((var_1_4 / 65536) * 65536) + var_1_5) <= (((var_1_5 / 65536) * 65536) + var_1_4)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5)))) || ((((((var_1_6 + 50) <= 0) && !((\result == 0))) && !((cond == 0))) && (var_1_3 == (256 * (var_1_3 / 256)))) && ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && (var_1_8 <= var_1_7)) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((var_1_7 + 1) <= var_1_8)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7)))))) [2023-11-06 22:49:41,795 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((var_1_6 + 50) <= 0) && !((\result == 0))) && (var_1_3 == (256 * (var_1_3 / 256)))) && ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && (var_1_8 <= var_1_7)) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((var_1_7 + 1) <= var_1_8)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))))) || (((((((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))) || ((((255 * var_1_9) + var_1_7) <= ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 102)) && ((((255 * var_1_9) + var_1_7) + 25) == ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + var_1_6)))) && ((var_1_7 + 1) <= var_1_8)) || ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((var_1_6 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) == (((255 * var_1_9) + var_1_8) + 25)) && (((255 * var_1_9) + var_1_8) <= (102 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))))) && (var_1_8 <= var_1_7))) && !((\result == 0))) && (((var_1_4 == (((var_1_4 / 65536) * 65536) + var_1_1)) && (((((var_1_5 / 65536) * 65536) + var_1_4) + 1) <= (((var_1_4 / 65536) * 65536) + var_1_5))) || (((((var_1_4 / 65536) * 65536) + var_1_5) <= (((var_1_5 / 65536) * 65536) + var_1_4)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) [2023-11-06 22:49:41,797 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))) || ((((255 * var_1_9) + var_1_7) <= ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 102)) && ((((255 * var_1_9) + var_1_7) + 25) == ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + var_1_6)))) && ((var_1_7 + 1) <= var_1_8)) || ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((var_1_6 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) == (((255 * var_1_9) + var_1_8) + 25)) && (((255 * var_1_9) + var_1_8) <= (102 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))))) && (var_1_8 <= var_1_7))) && !((\result == 0))) && !((cond == 0))) && (((var_1_4 == (((var_1_4 / 65536) * 65536) + var_1_1)) && (((((var_1_5 / 65536) * 65536) + var_1_4) + 1) <= (((var_1_4 / 65536) * 65536) + var_1_5))) || (((((var_1_4 / 65536) * 65536) + var_1_5) <= (((var_1_5 / 65536) * 65536) + var_1_4)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5)))) || ((((((var_1_6 + 50) <= 0) && !((\result == 0))) && !((cond == 0))) && (var_1_3 == (256 * (var_1_3 / 256)))) && ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && (var_1_8 <= var_1_7)) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((var_1_7 + 1) <= var_1_8)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7)))))) [2023-11-06 22:49:41,808 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:49:41,808 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:49:41,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:49:41,809 INFO L158 Benchmark]: Toolchain (without parser) took 8210.47ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 95.7MB in the beginning and 61.4MB in the end (delta: 34.2MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2023-11-06 22:49:41,810 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 134.2MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:41,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.83ms. Allocated memory is still 134.2MB. Free memory was 95.3MB in the beginning and 84.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:49:41,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.16ms. Allocated memory is still 134.2MB. Free memory was 84.1MB in the beginning and 81.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:49:41,811 INFO L158 Benchmark]: Boogie Preprocessor took 37.22ms. Allocated memory is still 134.2MB. Free memory was 81.7MB in the beginning and 80.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:41,811 INFO L158 Benchmark]: RCFGBuilder took 644.64ms. Allocated memory is still 134.2MB. Free memory was 80.3MB in the beginning and 67.4MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:49:41,812 INFO L158 Benchmark]: TraceAbstraction took 6953.67ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 66.7MB in the beginning and 65.6MB in the end (delta: 1.1MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2023-11-06 22:49:41,812 INFO L158 Benchmark]: Witness Printer took 109.65ms. Allocated memory is still 184.5MB. Free memory was 65.6MB in the beginning and 61.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:49:41,816 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.37ms. Allocated memory is still 134.2MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.83ms. Allocated memory is still 134.2MB. Free memory was 95.3MB in the beginning and 84.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.16ms. Allocated memory is still 134.2MB. Free memory was 84.1MB in the beginning and 81.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.22ms. Allocated memory is still 134.2MB. Free memory was 81.7MB in the beginning and 80.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 644.64ms. Allocated memory is still 134.2MB. Free memory was 80.3MB in the beginning and 67.4MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6953.67ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 66.7MB in the beginning and 65.6MB in the end (delta: 1.1MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Witness Printer took 109.65ms. Allocated memory is still 184.5MB. Free memory was 65.6MB in the beginning and 61.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 617 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 423 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 194 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 58 PreInvPairs, 95 NumberOfFragments, 673 HoareAnnotationTreeSize, 58 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 1106 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((((((var_1_6 + 50) <= 0) && !((\result == 0))) && (var_1_3 == (256 * (var_1_3 / 256)))) && ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && (var_1_8 <= var_1_7)) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((var_1_7 + 1) <= var_1_8)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))))) || (((((((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))) || ((((255 * var_1_9) + var_1_7) <= ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 102)) && ((((255 * var_1_9) + var_1_7) + 25) == ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + var_1_6)))) && ((var_1_7 + 1) <= var_1_8)) || ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((var_1_6 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) == (((255 * var_1_9) + var_1_8) + 25)) && (((255 * var_1_9) + var_1_8) <= (102 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))))) && (var_1_8 <= var_1_7))) && !((\result == 0))) && (((var_1_4 == (((var_1_4 / 65536) * 65536) + var_1_1)) && (((((var_1_5 / 65536) * 65536) + var_1_4) + 1) <= (((var_1_4 / 65536) * 65536) + var_1_5))) || (((((var_1_4 / 65536) * 65536) + var_1_5) <= (((var_1_5 / 65536) * 65536) + var_1_4)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7))) || ((((255 * var_1_9) + var_1_7) <= ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 102)) && ((((255 * var_1_9) + var_1_7) + 25) == ((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + var_1_6)))) && ((var_1_7 + 1) <= var_1_8)) || ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((var_1_6 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) == (((255 * var_1_9) + var_1_8) + 25)) && (((255 * var_1_9) + var_1_8) <= (102 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))))) && (var_1_8 <= var_1_7))) && !((\result == 0))) && !((cond == 0))) && (((var_1_4 == (((var_1_4 / 65536) * 65536) + var_1_1)) && (((((var_1_5 / 65536) * 65536) + var_1_4) + 1) <= (((var_1_4 / 65536) * 65536) + var_1_5))) || (((((var_1_4 / 65536) * 65536) + var_1_5) <= (((var_1_5 / 65536) * 65536) + var_1_4)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5)))) || ((((((var_1_6 + 50) <= 0) && !((\result == 0))) && !((cond == 0))) && (var_1_3 == (256 * (var_1_3 / 256)))) && ((((((255 * var_1_9) + var_1_8) == ((231 + var_1_6) + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256)))) && (var_1_8 <= var_1_7)) && ((103 + (256 * ((((255 * var_1_9) + var_1_8) + 25) / 256))) <= ((255 * var_1_9) + var_1_8))) || (((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 103) <= ((255 * var_1_9) + var_1_7)) && ((var_1_7 + 1) <= var_1_8)) && ((((256 * ((((255 * var_1_9) + var_1_7) + 25) / 256)) + 231) + var_1_6) == ((255 * var_1_9) + var_1_7)))))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:49:41,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b32fb2b-9b22-4153-88c4-a81edb712982/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