./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 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_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/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_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/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_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/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_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/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 6a79e771adfc453987e5cf461fecaf2182a327bb6bb8a3a5a2cd49df99352d71 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:03:48,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:03:48,754 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:03:48,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:03:48,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:03:48,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:03:48,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:03:48,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:03:48,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:03:48,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:03:48,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:03:48,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:03:48,793 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:03:48,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:03:48,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:03:48,795 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:03:48,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:03:48,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:03:48,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:03:48,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:03:48,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:03:48,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:03:48,804 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:03:48,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:03:48,805 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:03:48,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:03:48,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:03:48,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:03:48,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:03:48,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:03:48,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:03:48,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:03:48,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:03:48,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:03:48,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:03:48,818 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:03:48,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:03:48,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:03:48,819 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:03:48,819 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_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/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_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/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 -> 6a79e771adfc453987e5cf461fecaf2182a327bb6bb8a3a5a2cd49df99352d71 [2023-11-06 22:03:49,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:03:49,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:03:49,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:03:49,136 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:03:49,137 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:03:49,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-06 22:03:52,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:03:52,609 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:03:52,610 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-06 22:03:52,619 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/data/605d1286e/34f1cf72da7b4d9780c35f1a3481b84a/FLAG06aa621ab [2023-11-06 22:03:52,632 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/data/605d1286e/34f1cf72da7b4d9780c35f1a3481b84a [2023-11-06 22:03:52,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:03:52,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:03:52,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:03:52,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:03:52,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:03:52,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:52,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f16b8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52, skipping insertion in model container [2023-11-06 22:03:52,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:52,678 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:03:52,842 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_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i[915,928] [2023-11-06 22:03:52,879 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:03:52,891 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:03:52,905 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_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i[915,928] [2023-11-06 22:03:52,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:03:52,954 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:03:52,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52 WrapperNode [2023-11-06 22:03:52,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:03:52,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:03:52,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:03:52,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:03:52,965 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:03:52" (1/1) ... [2023-11-06 22:03:52,973 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:03:52" (1/1) ... [2023-11-06 22:03:53,021 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2023-11-06 22:03:53,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:03:53,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:03:53,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:03:53,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:03:53,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:03:53,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:03:53,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:03:53,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:03:53,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (1/1) ... [2023-11-06 22:03:53,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:03:53,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:53,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/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:03:53,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/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:03:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:03:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:03:53,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:03:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:03:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:03:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:03:53,235 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:03:53,237 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:03:53,517 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:03:53,524 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:03:53,525 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:03:53,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:03:53 BoogieIcfgContainer [2023-11-06 22:03:53,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:03:53,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:03:53,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:03:53,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:03:53,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:03:52" (1/3) ... [2023-11-06 22:03:53,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f2e59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:03:53, skipping insertion in model container [2023-11-06 22:03:53,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:52" (2/3) ... [2023-11-06 22:03:53,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f2e59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:03:53, skipping insertion in model container [2023-11-06 22:03:53,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:03:53" (3/3) ... [2023-11-06 22:03:53,550 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-06 22:03:53,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:03:53,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:03:53,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:03:53,634 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;@79bf4083, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:03:53,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:03:53,639 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-06 22:03:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:03:53,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:53,655 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-06 22:03:53,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:53,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash -892636444, now seen corresponding path program 1 times [2023-11-06 22:03:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174895794] [2023-11-06 22:03:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:03:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:03:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:03:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:03:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:03:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:03:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:03:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:03:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:53,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:03:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:03:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:03:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:03:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:03:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:03:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:03:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:03:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:03:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,092 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-06 22:03:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174895794] [2023-11-06 22:03:54,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174895794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:54,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:03:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936328344] [2023-11-06 22:03:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:54,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:03:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:54,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:03:54,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:03:54,141 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-06 22:03:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:54,186 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2023-11-06 22:03:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:03:54,189 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-06 22:03:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:54,197 INFO L225 Difference]: With dead ends: 95 [2023-11-06 22:03:54,197 INFO L226 Difference]: Without dead ends: 47 [2023-11-06 22:03:54,201 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-06 22:03:54,206 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-06 22:03:54,207 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-06 22:03:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-06 22:03:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-06 22:03:54,266 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-06 22:03:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2023-11-06 22:03:54,270 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 112 [2023-11-06 22:03:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:54,271 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2023-11-06 22:03:54,271 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-06 22:03:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2023-11-06 22:03:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:03:54,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:54,278 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-06 22:03:54,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:03:54,279 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:54,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:54,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1266591324, now seen corresponding path program 1 times [2023-11-06 22:03:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:54,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798430182] [2023-11-06 22:03:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:03:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:03:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:03:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:03:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:03:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:03:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:03:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:03:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:03:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:03:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:03:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:03:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:03:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:03:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:03:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:03:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:03:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:54,702 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-06 22:03:54,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:54,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798430182] [2023-11-06 22:03:54,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798430182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:54,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:54,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:03:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563521411] [2023-11-06 22:03:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:54,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:03:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:03:54,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:03:54,713 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-06 22:03:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:54,955 INFO L93 Difference]: Finished difference Result 91 states and 133 transitions. [2023-11-06 22:03:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:03:54,956 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-06 22:03:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:54,959 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:03:54,959 INFO L226 Difference]: Without dead ends: 47 [2023-11-06 22:03:54,960 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-06 22:03:54,962 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.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:54,963 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.2s Time] [2023-11-06 22:03:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-06 22:03:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-06 22:03:54,981 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-06 22:03:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2023-11-06 22:03:54,983 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 112 [2023-11-06 22:03:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:54,985 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2023-11-06 22:03:54,985 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-06 22:03:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2023-11-06 22:03:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:03:54,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:54,991 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-06 22:03:54,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:03:54,991 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:54,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1209333022, now seen corresponding path program 1 times [2023-11-06 22:03:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054345201] [2023-11-06 22:03:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:03:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:03:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:03:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:03:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:03:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:03:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:03:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:03:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:03:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:03:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:03:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:03:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:03:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:03:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:03:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:03:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:03:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:57,240 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-06 22:03:57,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:57,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054345201] [2023-11-06 22:03:57,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054345201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:57,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:57,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:03:57,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26749425] [2023-11-06 22:03:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:57,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:03:57,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:57,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:03:57,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:03:57,244 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-06 22:03:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:57,928 INFO L93 Difference]: Finished difference Result 110 states and 160 transitions. [2023-11-06 22:03:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:03:57,929 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-06 22:03:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:57,932 INFO L225 Difference]: With dead ends: 110 [2023-11-06 22:03:57,932 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:03:57,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 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-06 22:03:57,935 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 78 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:57,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 504 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:03:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:03:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 70. [2023-11-06 22:03:57,971 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-06 22:03:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2023-11-06 22:03:57,974 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 112 [2023-11-06 22:03:57,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:57,975 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2023-11-06 22:03:57,975 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-06 22:03:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2023-11-06 22:03:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:03:57,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:57,979 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-06 22:03:57,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:03:57,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:57,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1207485980, now seen corresponding path program 1 times [2023-11-06 22:03:57,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:57,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293269468] [2023-11-06 22:03:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:03:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:03:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:03:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:03:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:03:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:03:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:03:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:03:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:03:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:03:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:03:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:03:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:03:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:03:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:03:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:03:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:03:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,703 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-06 22:03:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293269468] [2023-11-06 22:03:59,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293269468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:59,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:59,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:03:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997309680] [2023-11-06 22:03:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:59,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:03:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:59,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:03:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:03:59,710 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-06 22:04:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:00,358 INFO L93 Difference]: Finished difference Result 108 states and 158 transitions. [2023-11-06 22:04:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:04:00,359 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-06 22:04:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:00,360 INFO L225 Difference]: With dead ends: 108 [2023-11-06 22:04:00,360 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:04:00,362 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-06 22:04:00,363 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 82 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:00,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 413 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:04:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:04:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:04:00,365 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:04:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:04:00,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2023-11-06 22:04:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:00,366 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:04:00,367 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-06 22:04:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:04:00,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:04:00,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:04:00,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:04:00,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:04:00,788 INFO L899 garLoopResultBuilder]: For program point L93(lines 66 94) no Hoare annotation was computed. [2023-11-06 22:04:00,789 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-06 22:04:00,789 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-06 22:04:00,789 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:04:00,789 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:04:00,790 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-11-06 22:04:00,790 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse0 (* 256 (div ~var_1_19~0 256)))) (and (= ~var_1_19~0 (+ ~var_1_8~0 .cse0)) (= (+ ~var_1_15~0 ~var_1_14~0 ~var_1_12~0) ~var_1_16~0) (= ~var_1_19~0 (+ ~var_1_18~0 .cse0)) (= ~var_1_19~0 ~var_1_20~0) (= ~var_1_17~0 ~var_1_14~0))) [2023-11-06 22:04:00,791 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-06 22:04:00,792 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-06 22:04:00,792 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 101 112) the Hoare annotation is: false [2023-11-06 22:04:00,792 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-11-06 22:04:00,792 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:04:00,792 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:04:00,792 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-06 22:04:00,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:04:00,794 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-06 22:04:00,795 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-06 22:04:00,795 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-06 22:04:00,796 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 97 100) the Hoare annotation is: (let ((.cse7 (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256))) (.cse9 (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0)) (.cse8 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse16 (* 256 (div ~var_1_19~0 256)))) (let ((.cse0 (= ~var_1_19~0 (+ ~var_1_8~0 .cse16))) (.cse10 (not .cse8)) (.cse11 (not .cse9)) (.cse12 (not .cse7)) (.cse1 (= (+ ~var_1_15~0 ~var_1_14~0 ~var_1_12~0) ~var_1_16~0)) (.cse2 (= ~var_1_19~0 (+ ~var_1_18~0 .cse16))) (.cse3 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse4 (= ~var_1_19~0 ~var_1_20~0)) (.cse13 (= ~var_1_17~0 ~var_1_14~0)) (.cse6 (+ (* (div ~var_1_8~0 536870912) 4294967296) ~var_1_18~0)) (.cse5 (+ (* ~var_1_8~0 8) (* (div ~var_1_18~0 4294967296) 4294967296)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) (or (and (= ~var_1_1~0 1) .cse7 .cse8 .cse9) (and (or .cse10 .cse11 .cse12) (= ~var_1_1~0 0))) .cse13) (let ((.cse15 (< .cse6 .cse5)) (.cse14 (* 256 (div ~var_1_1~0 256)))) (and .cse0 (= ~var_1_1~0 ~var_1_7~0) (or (= ~var_1_1~0 .cse14) (and .cse7 .cse8 .cse9) .cse15) (or .cse15 (= (+ .cse14 1) ~var_1_1~0) .cse10 .cse11 .cse12) .cse1 .cse2 .cse3 .cse4 .cse13))))) [2023-11-06 22:04:00,796 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-11-06 22:04:00,797 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 53) no Hoare annotation was computed. [2023-11-06 22:04:00,797 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-06 22:04:00,797 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-06 22:04:00,797 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 38) no Hoare annotation was computed. [2023-11-06 22:04:00,798 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:04:00,798 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 96) no Hoare annotation was computed. [2023-11-06 22:04:00,798 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-06 22:04:00,798 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-06 22:04:00,798 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-06 22:04:00,799 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-06 22:04:00,799 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-06 22:04:00,799 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:04:00,799 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-06 22:04:00,799 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-06 22:04:00,800 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-06 22:04:00,801 INFO L899 garLoopResultBuilder]: For program point L104-3(lines 104 110) no Hoare annotation was computed. [2023-11-06 22:04:00,804 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-06 22:04:00,805 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-06 22:04:00,805 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 59) no Hoare annotation was computed. [2023-11-06 22:04:00,806 INFO L899 garLoopResultBuilder]: For program point L55-2(lines 39 65) no Hoare annotation was computed. [2023-11-06 22:04:00,806 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-11-06 22:04:00,806 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-06 22:04:00,806 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-06 22:04:00,806 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-06 22:04:00,807 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 65) no Hoare annotation was computed. [2023-11-06 22:04:00,807 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-06 22:04:00,807 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-06 22:04:00,807 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:04:00,807 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:04:00,808 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:04:00,808 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:04:00,813 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:04:00,816 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:04:00,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:04:00 BoogieIcfgContainer [2023-11-06 22:04:00,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:04:00,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:04:00,863 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:04:00,863 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:04:00,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:03:53" (3/4) ... [2023-11-06 22:04:00,869 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:04:00,876 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:04:00,883 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:04:00,886 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:04:00,886 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:04:00,887 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:04:00,924 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((var_1_19 == (var_1_8 + (256 * (var_1_19 / 256)))) && (((var_1_15 + var_1_14) + var_1_12) == var_1_16)) && (var_1_19 == (var_1_18 + (256 * (var_1_19 / 256))))) && (1 <= \result)) && (var_1_19 == var_1_20)) && (((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296)) <= (((var_1_8 / 536870912) * 4294967296) + var_1_18))) && (((((var_1_1 == 1) && (var_1_5 == ((var_1_5 / 256) * 256))) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6)) || (((!(((256 * (var_1_4 / 256)) == var_1_4)) || !(((256 * (var_1_6 / 256)) == var_1_6))) || !((var_1_5 == ((var_1_5 / 256) * 256)))) && (var_1_1 == 0)))) && (var_1_17 == var_1_14)) || (((((((((var_1_19 == (var_1_8 + (256 * (var_1_19 / 256)))) && (var_1_1 == var_1_7)) && (((var_1_1 == (256 * (var_1_1 / 256))) || (((var_1_5 == ((var_1_5 / 256) * 256)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6))) || ((((var_1_8 / 536870912) * 4294967296) + var_1_18) < ((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296))))) && ((((((((var_1_8 / 536870912) * 4294967296) + var_1_18) < ((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296))) || (((256 * (var_1_1 / 256)) + 1) == var_1_1)) || !(((256 * (var_1_4 / 256)) == var_1_4))) || !(((256 * (var_1_6 / 256)) == var_1_6))) || !((var_1_5 == ((var_1_5 / 256) * 256))))) && (((var_1_15 + var_1_14) + var_1_12) == var_1_16)) && (var_1_19 == (var_1_18 + (256 * (var_1_19 / 256))))) && (1 <= \result)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_14))) [2023-11-06 22:04:00,965 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((var_1_19 == (var_1_8 + (256 * (var_1_19 / 256)))) && (((var_1_15 + var_1_14) + var_1_12) == var_1_16)) && (var_1_19 == (var_1_18 + (256 * (var_1_19 / 256))))) && (1 <= \result)) && (var_1_19 == var_1_20)) && (((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296)) <= (((var_1_8 / 536870912) * 4294967296) + var_1_18))) && (((((var_1_1 == 1) && (var_1_5 == ((var_1_5 / 256) * 256))) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6)) || (((!(((256 * (var_1_4 / 256)) == var_1_4)) || !(((256 * (var_1_6 / 256)) == var_1_6))) || !((var_1_5 == ((var_1_5 / 256) * 256)))) && (var_1_1 == 0)))) && (var_1_17 == var_1_14)) || (((((((((var_1_19 == (var_1_8 + (256 * (var_1_19 / 256)))) && (var_1_1 == var_1_7)) && (((var_1_1 == (256 * (var_1_1 / 256))) || (((var_1_5 == ((var_1_5 / 256) * 256)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6))) || ((((var_1_8 / 536870912) * 4294967296) + var_1_18) < ((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296))))) && ((((((((var_1_8 / 536870912) * 4294967296) + var_1_18) < ((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296))) || (((256 * (var_1_1 / 256)) + 1) == var_1_1)) || !(((256 * (var_1_4 / 256)) == var_1_4))) || !(((256 * (var_1_6 / 256)) == var_1_6))) || !((var_1_5 == ((var_1_5 / 256) * 256))))) && (((var_1_15 + var_1_14) + var_1_12) == var_1_16)) && (var_1_19 == (var_1_18 + (256 * (var_1_19 / 256))))) && (1 <= \result)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_14))) [2023-11-06 22:04:00,984 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:04:00,984 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:04:00,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:04:00,985 INFO L158 Benchmark]: Toolchain (without parser) took 8348.60ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 129.1MB in the beginning and 152.2MB in the end (delta: -23.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2023-11-06 22:04:00,985 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:04:00,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.93ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 116.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:04:00,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.96ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:04:00,987 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 161.5MB. Free memory was 114.4MB in the beginning and 113.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:04:00,987 INFO L158 Benchmark]: RCFGBuilder took 482.37ms. Allocated memory is still 161.5MB. Free memory was 113.0MB in the beginning and 98.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:04:00,988 INFO L158 Benchmark]: TraceAbstraction took 7318.38ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 97.6MB in the beginning and 157.4MB in the end (delta: -59.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2023-11-06 22:04:00,988 INFO L158 Benchmark]: Witness Printer took 122.44ms. Allocated memory is still 234.9MB. Free memory was 157.4MB in the beginning and 152.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:04:00,991 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.32ms. Allocated memory is still 125.8MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.93ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 116.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.96ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 161.5MB. Free memory was 114.4MB in the beginning and 113.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 482.37ms. Allocated memory is still 161.5MB. Free memory was 113.0MB in the beginning and 98.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7318.38ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 97.6MB in the beginning and 157.4MB in the end (delta: -59.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * Witness Printer took 122.44ms. Allocated memory is still 234.9MB. Free memory was 157.4MB in the beginning and 152.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 7.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 1069 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 709 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 360 mSDtfsCounter, 370 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.8s 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, 23 LocationsWithAnnotation, 104 PreInvPairs, 157 NumberOfFragments, 465 HoareAnnotationTreeSize, 104 FomulaSimplifications, 3644 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 234 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s 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: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((var_1_19 == (var_1_8 + (256 * (var_1_19 / 256)))) && (((var_1_15 + var_1_14) + var_1_12) == var_1_16)) && (var_1_19 == (var_1_18 + (256 * (var_1_19 / 256))))) && (1 <= \result)) && (var_1_19 == var_1_20)) && (((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296)) <= (((var_1_8 / 536870912) * 4294967296) + var_1_18))) && (((((var_1_1 == 1) && (var_1_5 == ((var_1_5 / 256) * 256))) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6)) || (((!(((256 * (var_1_4 / 256)) == var_1_4)) || !(((256 * (var_1_6 / 256)) == var_1_6))) || !((var_1_5 == ((var_1_5 / 256) * 256)))) && (var_1_1 == 0)))) && (var_1_17 == var_1_14)) || (((((((((var_1_19 == (var_1_8 + (256 * (var_1_19 / 256)))) && (var_1_1 == var_1_7)) && (((var_1_1 == (256 * (var_1_1 / 256))) || (((var_1_5 == ((var_1_5 / 256) * 256)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6))) || ((((var_1_8 / 536870912) * 4294967296) + var_1_18) < ((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296))))) && ((((((((var_1_8 / 536870912) * 4294967296) + var_1_18) < ((var_1_8 * 8) + ((var_1_18 / 4294967296) * 4294967296))) || (((256 * (var_1_1 / 256)) + 1) == var_1_1)) || !(((256 * (var_1_4 / 256)) == var_1_4))) || !(((256 * (var_1_6 / 256)) == var_1_6))) || !((var_1_5 == ((var_1_5 / 256) * 256))))) && (((var_1_15 + var_1_14) + var_1_12) == var_1_16)) && (var_1_19 == (var_1_18 + (256 * (var_1_19 / 256))))) && (1 <= \result)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_14))) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (var_1_19 < ((var_1_8 + (256 * (var_1_19 / 256))) + 1)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((var_1_19 == (var_1_8 + (256 * (var_1_19 / 256)))) && (((var_1_15 + var_1_14) + var_1_12) == var_1_16)) && (var_1_19 == (var_1_18 + (256 * (var_1_19 / 256))))) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_14)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:04:01,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_990cf140-94f4-493c-b7a3-d9fd7bff8d1c/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