./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a79e771adfc453987e5cf461fecaf2182a327bb6bb8a3a5a2cd49df99352d71 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:14:37,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:14:37,459 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:14:37,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:14:37,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:14:37,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:14:37,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:14:37,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:14:37,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:14:37,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:14:37,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:14:37,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:14:37,508 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:14:37,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:14:37,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:14:37,511 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:14:37,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:14:37,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:14:37,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:14:37,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:14:37,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:14:37,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:14:37,517 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:14:37,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:14:37,518 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:14:37,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:14:37,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:14:37,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:14:37,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:37,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:14:37,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:14:37,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:14:37,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:14:37,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:14:37,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:14:37,524 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:14:37,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:14:37,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:14:37,525 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:14:37,526 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_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/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_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a79e771adfc453987e5cf461fecaf2182a327bb6bb8a3a5a2cd49df99352d71 [2023-11-12 02:14:37,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:14:37,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:14:37,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:14:37,838 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:14:37,838 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:14:37,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-12 02:14:41,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:14:41,444 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:14:41,445 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-12 02:14:41,454 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/data/631420915/1925170d4af84eebb0aea7b8e7e38360/FLAG78058c418 [2023-11-12 02:14:41,468 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/data/631420915/1925170d4af84eebb0aea7b8e7e38360 [2023-11-12 02:14:41,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:14:41,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:14:41,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:41,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:14:41,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:14:41,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5d0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41, skipping insertion in model container [2023-11-12 02:14:41,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,517 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:14:41,705 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_9e7c1368-5f52-4293-b369-95dcec6b0daf/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i[915,928] [2023-11-12 02:14:41,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:41,781 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:14:41,795 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_9e7c1368-5f52-4293-b369-95dcec6b0daf/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i[915,928] [2023-11-12 02:14:41,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:41,834 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:14:41,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41 WrapperNode [2023-11-12 02:14:41,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:41,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:41,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:14:41,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:14:41,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,884 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2023-11-12 02:14:41,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:41,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:14:41,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:14:41,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:14:41,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:14:41,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:14:41,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:14:41,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:14:41,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (1/1) ... [2023-11-12 02:14:41,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:41,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:41,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:41,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:14:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:14:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:14:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:14:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:14:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:14:42,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:14:42,111 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:14:42,115 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:14:42,438 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:14:42,446 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:14:42,447 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:14:42,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:42 BoogieIcfgContainer [2023-11-12 02:14:42,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:14:42,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:14:42,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:14:42,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:14:42,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:14:41" (1/3) ... [2023-11-12 02:14:42,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38291bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:42, skipping insertion in model container [2023-11-12 02:14:42,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:41" (2/3) ... [2023-11-12 02:14:42,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38291bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:42, skipping insertion in model container [2023-11-12 02:14:42,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:42" (3/3) ... [2023-11-12 02:14:42,459 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-12 02:14:42,479 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:14:42,479 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:14:42,530 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:14:42,538 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@709814e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:14:42,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:14:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:14:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-12 02:14:42,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:42,559 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:14:42,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:42,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:42,565 INFO L85 PathProgramCache]: Analyzing trace with hash -892636444, now seen corresponding path program 1 times [2023-11-12 02:14:42,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:42,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899481299] [2023-11-12 02:14:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:14:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:14:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:14:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:14:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:14:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:14:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:14:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:14:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:14:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:14:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:14:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:14:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:14:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:14:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:14:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:14:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:14:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:14:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:14:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:43,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899481299] [2023-11-12 02:14:43,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899481299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:43,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:43,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:14:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242231146] [2023-11-12 02:14:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:43,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:14:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:43,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:14:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:14:43,259 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:14:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:43,308 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2023-11-12 02:14:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:14:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2023-11-12 02:14:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:43,320 INFO L225 Difference]: With dead ends: 95 [2023-11-12 02:14:43,320 INFO L226 Difference]: Without dead ends: 47 [2023-11-12 02:14:43,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-12 02:14:43,329 INFO L413 NwaCegarLoop]: 68 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, 68 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-12 02:14:43,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:14:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-12 02:14:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-12 02:14:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:14:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2023-11-12 02:14:43,380 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 112 [2023-11-12 02:14:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:43,381 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2023-11-12 02:14:43,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:14:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2023-11-12 02:14:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-12 02:14:43,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:43,390 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:14:43,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:14:43,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:43,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1266591324, now seen corresponding path program 1 times [2023-11-12 02:14:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:43,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788068871] [2023-11-12 02:14:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:14:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:14:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:14:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:14:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:14:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:14:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:14:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:14:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:14:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:14:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:14:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:14:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:14:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:14:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:14:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:14:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:14:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:14:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:14:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788068871] [2023-11-12 02:14:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788068871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:43,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:14:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640913379] [2023-11-12 02:14:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:43,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:43,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:14:43,850 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:14:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:44,054 INFO L93 Difference]: Finished difference Result 91 states and 133 transitions. [2023-11-12 02:14:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:44,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-11-12 02:14:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:44,057 INFO L225 Difference]: With dead ends: 91 [2023-11-12 02:14:44,057 INFO L226 Difference]: Without dead ends: 47 [2023-11-12 02:14:44,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:14:44,060 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 64 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:44,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 84 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:14:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-12 02:14:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-12 02:14:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:14:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2023-11-12 02:14:44,080 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 112 [2023-11-12 02:14:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:44,082 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2023-11-12 02:14:44,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:14:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2023-11-12 02:14:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-12 02:14:44,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:44,086 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:14:44,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:14:44,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:44,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1209333022, now seen corresponding path program 1 times [2023-11-12 02:14:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848595789] [2023-11-12 02:14:44,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:14:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:14:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:14:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:14:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:14:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:14:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:14:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:14:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:14:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:14:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:14:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:14:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:14:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:14:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:14:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:14:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:14:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:14:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:14:46,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:46,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848595789] [2023-11-12 02:14:46,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848595789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:46,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:14:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023843450] [2023-11-12 02:14:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:46,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:14:46,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:46,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:14:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:14:46,655 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:14:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:47,433 INFO L93 Difference]: Finished difference Result 110 states and 160 transitions. [2023-11-12 02:14:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:14:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-11-12 02:14:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:47,445 INFO L225 Difference]: With dead ends: 110 [2023-11-12 02:14:47,446 INFO L226 Difference]: Without dead ends: 108 [2023-11-12 02:14:47,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 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-12 02:14:47,452 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 96 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:47,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 470 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:14:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-12 02:14:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 70. [2023-11-12 02:14:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-12 02:14:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2023-11-12 02:14:47,513 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 112 [2023-11-12 02:14:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:47,514 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2023-11-12 02:14:47,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:14:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2023-11-12 02:14:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-12 02:14:47,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:47,525 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:14:47,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:14:47,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:47,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1207485980, now seen corresponding path program 1 times [2023-11-12 02:14:47,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:47,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171641025] [2023-11-12 02:14:47,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:47,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:14:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:14:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:14:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:14:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:14:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:14:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:14:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:14:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:14:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:14:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:14:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:14:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:14:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:14:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:14:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:14:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:14:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:14:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:14:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171641025] [2023-11-12 02:14:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171641025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:49,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:14:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464136835] [2023-11-12 02:14:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:49,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:14:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:49,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:14:49,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:14:49,680 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:14:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:50,380 INFO L93 Difference]: Finished difference Result 108 states and 158 transitions. [2023-11-12 02:14:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:14:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-11-12 02:14:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:50,382 INFO L225 Difference]: With dead ends: 108 [2023-11-12 02:14:50,383 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:14:50,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:14:50,386 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 70 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:50,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 453 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:14:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:14:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:14:50,388 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-12 02:14:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:14:50,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2023-11-12 02:14:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:50,389 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:14:50,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:14:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:14:50,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:14:50,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:14:50,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:14:50,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:14:50,567 INFO L899 garLoopResultBuilder]: For program point L93(lines 66 94) no Hoare annotation was computed. [2023-11-12 02:14:50,567 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,567 INFO L895 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,568 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-12 02:14:50,568 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-12 02:14:50,568 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-11-12 02:14:50,568 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-12 02:14:50,568 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,569 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,569 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 101 112) no Hoare annotation was computed. [2023-11-12 02:14:50,569 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-11-12 02:14:50,569 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:14:50,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:14:50,570 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-12 02:14:50,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-12 02:14:50,570 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,570 INFO L895 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,571 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-12 02:14:50,571 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 97 100) no Hoare annotation was computed. [2023-11-12 02:14:50,571 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-11-12 02:14:50,571 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 53) no Hoare annotation was computed. [2023-11-12 02:14:50,571 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,572 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,572 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 38) no Hoare annotation was computed. [2023-11-12 02:14:50,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:14:50,572 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 96) no Hoare annotation was computed. [2023-11-12 02:14:50,572 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-12 02:14:50,573 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,573 INFO L895 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,573 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-12 02:14:50,573 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-12 02:14:50,573 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:14:50,574 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,574 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,574 INFO L895 garLoopResultBuilder]: At program point L104-2(lines 104 110) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,574 INFO L899 garLoopResultBuilder]: For program point L104-3(lines 104 110) no Hoare annotation was computed. [2023-11-12 02:14:50,575 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,575 INFO L895 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,575 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 59) no Hoare annotation was computed. [2023-11-12 02:14:50,575 INFO L899 garLoopResultBuilder]: For program point L55-2(lines 39 65) no Hoare annotation was computed. [2023-11-12 02:14:50,575 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-11-12 02:14:50,576 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,576 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,576 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-12 02:14:50,576 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 65) no Hoare annotation was computed. [2023-11-12 02:14:50,577 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,577 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-12 02:14:50,577 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-12 02:14:50,577 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-12 02:14:50,578 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-12 02:14:50,578 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-12 02:14:50,581 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-12 02:14:50,584 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:14:50,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:14:50 BoogieIcfgContainer [2023-11-12 02:14:50,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:14:50,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:14:50,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:14:50,604 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:14:50,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:42" (3/4) ... [2023-11-12 02:14:50,607 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:14:50,611 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 02:14:50,621 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-12 02:14:50,621 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:14:50,622 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:14:50,622 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:14:50,767 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:14:50,770 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:14:50,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:14:50,771 INFO L158 Benchmark]: Toolchain (without parser) took 9298.03ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 106.1MB in the beginning and 79.0MB in the end (delta: 27.1MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2023-11-12 02:14:50,773 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 111.1MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:14:50,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.82ms. Allocated memory is still 144.7MB. Free memory was 105.7MB in the beginning and 93.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:14:50,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.19ms. Allocated memory is still 144.7MB. Free memory was 93.8MB in the beginning and 91.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:14:50,774 INFO L158 Benchmark]: Boogie Preprocessor took 35.40ms. Allocated memory is still 144.7MB. Free memory was 91.2MB in the beginning and 90.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:14:50,774 INFO L158 Benchmark]: RCFGBuilder took 527.49ms. Allocated memory is still 144.7MB. Free memory was 90.0MB in the beginning and 113.5MB in the end (delta: -23.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-11-12 02:14:50,775 INFO L158 Benchmark]: TraceAbstraction took 8150.74ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 113.2MB in the beginning and 85.3MB in the end (delta: 27.9MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. [2023-11-12 02:14:50,775 INFO L158 Benchmark]: Witness Printer took 167.97ms. Allocated memory is still 209.7MB. Free memory was 85.3MB in the beginning and 79.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:14:50,778 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.38ms. Allocated memory is still 111.1MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.82ms. Allocated memory is still 144.7MB. Free memory was 105.7MB in the beginning and 93.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.19ms. Allocated memory is still 144.7MB. Free memory was 93.8MB in the beginning and 91.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.40ms. Allocated memory is still 144.7MB. Free memory was 91.2MB in the beginning and 90.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.49ms. Allocated memory is still 144.7MB. Free memory was 90.0MB in the beginning and 113.5MB in the end (delta: -23.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8150.74ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 113.2MB in the beginning and 85.3MB in the end (delta: 27.9MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. * Witness Printer took 167.97ms. Allocated memory is still 209.7MB. Free memory was 85.3MB in the beginning and 79.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 1075 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 712 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 363 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=3, InterpolantAutomatonStates: 30, 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, 38 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 101 PreInvPairs, 150 NumberOfFragments, 191 HoareAnnotationTreeSize, 101 FomulaSimplifications, 3308 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2448/2448 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: 104]: Loop Invariant Derived loop invariant: (var_1_19 < ((var_1_8 + (256 * (var_1_19 / 256))) + 1)) RESULT: Ultimate proved your program to be correct! [2023-11-12 02:14:50,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e7c1368-5f52-4293-b369-95dcec6b0daf/bin/uautomizer-verify-uTZkv6EMXl/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