./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.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_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/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_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/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_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/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 46a7ff4188c2c3bafb15fa2cd18d09e96971932e8eae948280cc4b8fb8a2f5fb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:10:35,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:10:35,773 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:10:35,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:10:35,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:10:35,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:10:35,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:10:35,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:10:35,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:10:35,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:10:35,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:10:35,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:10:35,837 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:10:35,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:10:35,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:10:35,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:10:35,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:10:35,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:10:35,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:10:35,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:10:35,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:10:35,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:10:35,842 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:10:35,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:10:35,843 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:10:35,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:10:35,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:10:35,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:10:35,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:35,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:10:35,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:10:35,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:10:35,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:10:35,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:10:35,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:10:35,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:10:35,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:10:35,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:10:35,849 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:10:35,849 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_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/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_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/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 -> 46a7ff4188c2c3bafb15fa2cd18d09e96971932e8eae948280cc4b8fb8a2f5fb [2023-11-06 22:10:36,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:10:36,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:10:36,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:10:36,176 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:10:36,177 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:10:36,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-11-06 22:10:39,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:10:39,669 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:10:39,669 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-11-06 22:10:39,680 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/data/a427c4b31/76cdc394edac44c3b23ab3ffba81e149/FLAG011d5aef9 [2023-11-06 22:10:39,953 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/data/a427c4b31/76cdc394edac44c3b23ab3ffba81e149 [2023-11-06 22:10:39,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:10:39,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:39,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:39,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:39,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:39,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:39" (1/1) ... [2023-11-06 22:10:39,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1955f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:39, skipping insertion in model container [2023-11-06 22:10:39,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:39" (1/1) ... [2023-11-06 22:10:40,004 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:40,166 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_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i[915,928] [2023-11-06 22:10:40,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:40,235 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:40,249 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_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i[915,928] [2023-11-06 22:10:40,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:40,301 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:40,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40 WrapperNode [2023-11-06 22:10:40,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:40,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:40,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:40,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:40,312 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:10:40" (1/1) ... [2023-11-06 22:10:40,326 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:10:40" (1/1) ... [2023-11-06 22:10:40,389 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2023-11-06 22:10:40,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:40,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:40,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:40,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:40,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:40,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:40,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:40,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:40,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (1/1) ... [2023-11-06 22:10:40,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:40,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:40,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/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:10:40,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/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:10:40,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:40,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:10:40,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:10:40,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:10:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:40,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:40,673 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:40,677 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:41,164 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:41,201 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:41,202 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:10:41,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:41 BoogieIcfgContainer [2023-11-06 22:10:41,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:41,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:41,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:41,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:41,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:10:39" (1/3) ... [2023-11-06 22:10:41,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d25776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:41, skipping insertion in model container [2023-11-06 22:10:41,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:40" (2/3) ... [2023-11-06 22:10:41,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d25776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:41, skipping insertion in model container [2023-11-06 22:10:41,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:41" (3/3) ... [2023-11-06 22:10:41,218 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-11-06 22:10:41,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:41,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:10:41,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:41,371 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;@4d2d7a0a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:41,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:10:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:10:41,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:41,399 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:41,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:41,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -740351714, now seen corresponding path program 1 times [2023-11-06 22:10:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832793575] [2023-11-06 22:10:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:41,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:10:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:10:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:10:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:10:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:10:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:10:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:10:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:10:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:10:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:10:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:10:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:10:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:10:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:42,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832793575] [2023-11-06 22:10:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832793575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:42,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:42,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003760466] [2023-11-06 22:10:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:42,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:10:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:10:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:10:42,170 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:10:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:42,223 INFO L93 Difference]: Finished difference Result 93 states and 151 transitions. [2023-11-06 22:10:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:10:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2023-11-06 22:10:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:42,238 INFO L225 Difference]: With dead ends: 93 [2023-11-06 22:10:42,239 INFO L226 Difference]: Without dead ends: 44 [2023-11-06 22:10:42,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:10:42,253 INFO L413 NwaCegarLoop]: 66 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, 66 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:10:42,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-06 22:10:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-06 22:10:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2023-11-06 22:10:42,316 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 101 [2023-11-06 22:10:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:42,316 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2023-11-06 22:10:42,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:10:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2023-11-06 22:10:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:10:42,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:42,323 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:10:42,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:42,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1164722462, now seen corresponding path program 1 times [2023-11-06 22:10:42,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:42,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350845003] [2023-11-06 22:10:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:42,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:10:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:10:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:10:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:10:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:10:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:10:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:10:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:10:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:10:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:10:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:10:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:10:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:10:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:42,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350845003] [2023-11-06 22:10:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350845003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:42,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:42,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103343256] [2023-11-06 22:10:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:42,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:42,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:42,599 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:42,697 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2023-11-06 22:10:42,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:42,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-06 22:10:42,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:42,702 INFO L225 Difference]: With dead ends: 115 [2023-11-06 22:10:42,704 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 22:10:42,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 22:10:42,708 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 55 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:42,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 22:10:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2023-11-06 22:10:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2023-11-06 22:10:42,737 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 101 [2023-11-06 22:10:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:42,738 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2023-11-06 22:10:42,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2023-11-06 22:10:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:10:42,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:42,741 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:10:42,742 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:42,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1355237472, now seen corresponding path program 1 times [2023-11-06 22:10:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651249173] [2023-11-06 22:10:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:10:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:10:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:10:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:10:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:10:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:10:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:10:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:10:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:10:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:10:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:10:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:10:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:10:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651249173] [2023-11-06 22:10:43,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651249173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:43,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:43,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974343058] [2023-11-06 22:10:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:43,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:43,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:43,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:43,159 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:43,197 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2023-11-06 22:10:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:43,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-06 22:10:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:43,202 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:10:43,203 INFO L226 Difference]: Without dead ends: 44 [2023-11-06 22:10:43,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 22:10:43,207 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:43,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-06 22:10:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-06 22:10:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2023-11-06 22:10:43,231 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 101 [2023-11-06 22:10:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:43,232 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2023-11-06 22:10:43,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2023-11-06 22:10:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:10:43,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:43,241 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:43,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:10:43,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:43,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1297979170, now seen corresponding path program 1 times [2023-11-06 22:10:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926261533] [2023-11-06 22:10:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:10:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:10:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:10:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:10:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:10:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:10:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:10:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:10:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:10:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:10:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:10:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:10:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:10:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:56,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926261533] [2023-11-06 22:10:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926261533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:56,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:10:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224463090] [2023-11-06 22:10:56,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:56,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:10:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:10:56,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:10:56,261 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:57,060 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2023-11-06 22:10:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:10:57,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-06 22:10:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:57,063 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:10:57,063 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:10:57,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:10:57,067 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 51 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:57,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 413 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:10:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:10:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:10:57,069 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:10:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:10:57,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2023-11-06 22:10:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:57,069 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:10:57,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:10:57,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:10:57,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:10:57,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:10:57,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:10:57,761 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-06 22:10:57,761 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,762 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,762 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:10:57,762 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:10:57,762 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,763 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,763 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse6 (* ~var_1_11~0 65535)) (.cse7 (div ~var_1_11~0 256))) (let ((.cse0 (+ (* 256 (div ~var_1_15~0 256)) ~var_1_20~0)) (.cse3 (* .cse7 256)) (.cse1 (div ~var_1_1~0 65536)) (.cse5 (div ~var_1_7~0 65536)) (.cse4 (div (+ .cse6 ~var_1_8~0 (* .cse7 (- 16776960))) 65536))) (and (<= 25 ~var_1_1~0) (<= 1 |ULTIMATE.start_property_#res#1|) (<= ~var_1_20~0 255) (<= ~var_1_15~0 .cse0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= ~var_1_1~0 (+ (* .cse1 65536) ~var_1_19~0)) (let ((.cse2 (+ .cse3 ~var_1_6~0))) (or (and (= ~var_1_6~0 ~var_1_10~0) (<= .cse2 ~var_1_11~0)) (and (<= (+ ~var_1_11~0 1) .cse2) (= (+ .cse3 ~var_1_10~0) ~var_1_11~0)))) (= .cse0 (+ (* 65536 (div ~var_1_20~0 65536)) ~var_1_15~0)) (= (+ (* 256 (div (+ ~var_1_13~0 ~var_1_12~0) 256)) ~var_1_11~0) (+ .cse3 ~var_1_13~0 ~var_1_12~0)) (<= (+ .cse3 .cse4) (+ (div ~var_1_8~0 65536) ~var_1_11~0 .cse5)) (<= .cse1 0) (= (* (div ~var_1_18~0 256) 256) ~var_1_18~0) (= (+ .cse6 ~var_1_8~0 (* 65536 .cse5)) (+ ~var_1_7~0 (* 65536 .cse4) (* .cse7 16776960)))))) [2023-11-06 22:10:57,764 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 40 57) no Hoare annotation was computed. [2023-11-06 22:10:57,764 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-11-06 22:10:57,764 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 90 102) the Hoare annotation is: true [2023-11-06 22:10:57,764 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 57) no Hoare annotation was computed. [2023-11-06 22:10:57,764 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,765 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,765 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:10:57,765 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-06 22:10:57,765 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:10:57,765 INFO L899 garLoopResultBuilder]: For program point L94-2(lines 94 100) no Hoare annotation was computed. [2023-11-06 22:10:57,765 INFO L895 garLoopResultBuilder]: At program point L94-3(lines 94 100) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,766 INFO L899 garLoopResultBuilder]: For program point L94-4(lines 94 100) no Hoare annotation was computed. [2023-11-06 22:10:57,766 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:10:57,766 INFO L899 garLoopResultBuilder]: For program point L82(lines 58 83) no Hoare annotation was computed. [2023-11-06 22:10:57,766 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,767 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 86 89) the Hoare annotation is: (let ((.cse6 (* ~var_1_11~0 65535)) (.cse7 (div ~var_1_11~0 256))) (let ((.cse0 (+ (* 256 (div ~var_1_15~0 256)) ~var_1_20~0)) (.cse3 (* .cse7 256)) (.cse1 (div ~var_1_1~0 65536)) (.cse5 (div ~var_1_7~0 65536)) (.cse4 (div (+ .cse6 ~var_1_8~0 (* .cse7 (- 16776960))) 65536))) (and (<= 25 ~var_1_1~0) (<= 1 |ULTIMATE.start_property_#res#1|) (<= ~var_1_20~0 255) (<= ~var_1_15~0 .cse0) (= ~var_1_1~0 (+ (* .cse1 65536) ~var_1_19~0)) (let ((.cse2 (+ .cse3 ~var_1_6~0))) (or (and (= ~var_1_6~0 ~var_1_10~0) (<= .cse2 ~var_1_11~0)) (and (<= (+ ~var_1_11~0 1) .cse2) (= (+ .cse3 ~var_1_10~0) ~var_1_11~0)))) (= .cse0 (+ (* 65536 (div ~var_1_20~0 65536)) ~var_1_15~0)) (= (+ (* 256 (div (+ ~var_1_13~0 ~var_1_12~0) 256)) ~var_1_11~0) (+ .cse3 ~var_1_13~0 ~var_1_12~0)) (<= (+ .cse3 .cse4) (+ (div ~var_1_8~0 65536) ~var_1_11~0 .cse5)) (<= .cse1 0) (= (* (div ~var_1_18~0 256) 256) ~var_1_18~0) (= (+ .cse6 ~var_1_8~0 (* 65536 .cse5)) (+ ~var_1_7~0 (* 65536 .cse4) (* .cse7 16776960)))))) [2023-11-06 22:10:57,767 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,767 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-06 22:10:57,768 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,768 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,768 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:10:57,768 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-06 22:10:57,768 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,769 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,769 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:10:57,769 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2023-11-06 22:10:57,769 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-06 22:10:57,769 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,769 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,770 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 85) no Hoare annotation was computed. [2023-11-06 22:10:57,770 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 53) no Hoare annotation was computed. [2023-11-06 22:10:57,770 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-06 22:10:57,770 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-11-06 22:10:57,770 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 40 57) no Hoare annotation was computed. [2023-11-06 22:10:57,771 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,771 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 22:10:57,771 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:10:57,771 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:10:57,771 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:10:57,772 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:10:57,776 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:10:57,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:10:57,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:10:57 BoogieIcfgContainer [2023-11-06 22:10:57,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:10:57,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:10:57,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:10:57,808 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:10:57,809 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:41" (3/4) ... [2023-11-06 22:10:57,811 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:10:57,817 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:10:57,830 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:10:57,830 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:10:57,831 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:10:57,831 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:10:57,875 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((25 <= var_1_1) && (1 <= \result)) && (var_1_20 <= 255)) && (var_1_15 <= ((256 * (var_1_15 / 256)) + var_1_20))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * (var_1_15 / 256)) + var_1_20) == ((65536 * (var_1_20 / 65536)) + var_1_15))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) [2023-11-06 22:10:57,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((25 <= var_1_1) && (1 <= \result)) && (var_1_20 <= 255)) && (var_1_15 <= ((256 * (var_1_15 / 256)) + var_1_20))) && (1 <= cond)) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * (var_1_15 / 256)) + var_1_20) == ((65536 * (var_1_20 / 65536)) + var_1_15))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) [2023-11-06 22:10:57,921 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((25 <= var_1_1) && (1 <= \result)) && (var_1_20 <= 255)) && (var_1_15 <= ((256 * (var_1_15 / 256)) + var_1_20))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * (var_1_15 / 256)) + var_1_20) == ((65536 * (var_1_20 / 65536)) + var_1_15))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) [2023-11-06 22:10:57,922 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((25 <= var_1_1) && (1 <= \result)) && (var_1_20 <= 255)) && (var_1_15 <= ((256 * (var_1_15 / 256)) + var_1_20))) && (1 <= cond)) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * (var_1_15 / 256)) + var_1_20) == ((65536 * (var_1_20 / 65536)) + var_1_15))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) [2023-11-06 22:10:57,941 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:10:57,942 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:10:57,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:10:57,943 INFO L158 Benchmark]: Toolchain (without parser) took 17984.58ms. Allocated memory was 134.2MB in the beginning and 287.3MB in the end (delta: 153.1MB). Free memory was 103.4MB in the beginning and 198.7MB in the end (delta: -95.3MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2023-11-06 22:10:57,943 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:10:57,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.86ms. Allocated memory is still 134.2MB. Free memory was 103.0MB in the beginning and 90.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:10:57,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.49ms. Allocated memory is still 134.2MB. Free memory was 90.5MB in the beginning and 86.8MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:57,944 INFO L158 Benchmark]: Boogie Preprocessor took 45.56ms. Allocated memory is still 134.2MB. Free memory was 86.8MB in the beginning and 85.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:57,947 INFO L158 Benchmark]: RCFGBuilder took 768.21ms. Allocated memory is still 134.2MB. Free memory was 85.0MB in the beginning and 104.1MB in the end (delta: -19.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:57,947 INFO L158 Benchmark]: TraceAbstraction took 16598.27ms. Allocated memory was 134.2MB in the beginning and 287.3MB in the end (delta: 153.1MB). Free memory was 103.3MB in the beginning and 203.9MB in the end (delta: -100.5MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2023-11-06 22:10:57,948 INFO L158 Benchmark]: Witness Printer took 134.26ms. Allocated memory is still 287.3MB. Free memory was 202.8MB in the beginning and 198.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:10:57,951 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.18ms. Allocated memory is still 111.1MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.86ms. Allocated memory is still 134.2MB. Free memory was 103.0MB in the beginning and 90.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.49ms. Allocated memory is still 134.2MB. Free memory was 90.5MB in the beginning and 86.8MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.56ms. Allocated memory is still 134.2MB. Free memory was 86.8MB in the beginning and 85.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 768.21ms. Allocated memory is still 134.2MB. Free memory was 85.0MB in the beginning and 104.1MB in the end (delta: -19.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16598.27ms. Allocated memory was 134.2MB in the beginning and 287.3MB in the end (delta: 153.1MB). Free memory was 103.3MB in the beginning and 203.9MB in the end (delta: -100.5MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * Witness Printer took 134.26ms. Allocated memory is still 287.3MB. Free memory was 202.8MB in the beginning and 198.7MB 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, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 370 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 313 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 30 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 100 PreInvPairs, 137 NumberOfFragments, 492 HoareAnnotationTreeSize, 100 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 1004 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 1024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 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: 94]: Loop Invariant Derived loop invariant: ((25 <= var_1_1) && ((var_1_1 / 65536) <= 0)) - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((((((((25 <= var_1_1) && (1 <= \result)) && (var_1_20 <= 255)) && (var_1_15 <= ((256 * (var_1_15 / 256)) + var_1_20))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * (var_1_15 / 256)) + var_1_20) == ((65536 * (var_1_20 / 65536)) + var_1_15))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((((((((25 <= var_1_1) && (1 <= \result)) && (var_1_20 <= 255)) && (var_1_15 <= ((256 * (var_1_15 / 256)) + var_1_20))) && (1 <= cond)) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * (var_1_15 / 256)) + var_1_20) == ((65536 * (var_1_20 / 65536)) + var_1_15))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:10:58,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2e454e-1db5-440b-b77d-71d2fb3b2f9c/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