./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU --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 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:20,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:20,793 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:02:20,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:20,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:20,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:20,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:20,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:20,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:20,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:20,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:20,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:20,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:20,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:20,856 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:20,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:20,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:02:20,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:20,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:20,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:20,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:20,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:02:20,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:20,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:02:20,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:20,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:20,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:02:20,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:20,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:20,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:20,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:20,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:20,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:20,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:20,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:20,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:02:20,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:02:20,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:02:20,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:20,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:20,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:20,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:20,869 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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b [2024-10-31 22:02:21,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:21,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:21,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:21,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:21,314 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:21,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i Unable to find full path for "g++" [2024-10-31 22:02:23,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:23,524 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:23,525 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2024-10-31 22:02:23,535 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/data/ddda4f0f3/9038c539e3a84d398a89fb3cb8e61c1d/FLAGc4424dc29 [2024-10-31 22:02:23,554 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/data/ddda4f0f3/9038c539e3a84d398a89fb3cb8e61c1d [2024-10-31 22:02:23,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:23,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:23,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:23,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:23,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:23,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66abe5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23, skipping insertion in model container [2024-10-31 22:02:23,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:23,826 WARN L251 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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2024-10-31 22:02:23,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:23,902 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:23,938 WARN L251 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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2024-10-31 22:02:24,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:24,050 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:24,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24 WrapperNode [2024-10-31 22:02:24,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:24,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:24,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:24,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:24,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,123 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-31 22:02:24,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:24,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:24,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:24,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:24,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,163 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:02:24,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:24,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:24,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:24,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:24,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (1/1) ... [2024-10-31 22:02:24,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:24,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:24,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:02:24,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:02:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:02:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:24,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:24,427 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:24,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:24,920 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-31 22:02:24,921 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:24,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:24,940 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:02:24,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:24 BoogieIcfgContainer [2024-10-31 22:02:24,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:24,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:24,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:24,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:24,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:23" (1/3) ... [2024-10-31 22:02:24,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0bd751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:24, skipping insertion in model container [2024-10-31 22:02:24,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:24" (2/3) ... [2024-10-31 22:02:24,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0bd751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:24, skipping insertion in model container [2024-10-31 22:02:24,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:24" (3/3) ... [2024-10-31 22:02:24,957 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2024-10-31 22:02:24,981 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:24,981 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:02:25,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:25,106 INFO L333 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, 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;@6986481a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:25,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:02:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 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) [2024-10-31 22:02:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-31 22:02:25,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:25,140 INFO L215 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, 1, 1] [2024-10-31 22:02:25,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 912981449, now seen corresponding path program 1 times [2024-10-31 22:02:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529119638] [2024-10-31 22:02:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:02:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:02:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:02:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:02:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:02:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:02:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:02:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:02:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:02:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:02:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:02:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:02:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:02:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:02:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:02:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:02:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529119638] [2024-10-31 22:02:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529119638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:25,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:25,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390327838] [2024-10-31 22:02:25,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:25,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:02:25,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:02:25,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:02:25,762 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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) [2024-10-31 22:02:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:25,804 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2024-10-31 22:02:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:02:25,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 114 [2024-10-31 22:02:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:25,818 INFO L225 Difference]: With dead ends: 105 [2024-10-31 22:02:25,818 INFO L226 Difference]: Without dead ends: 52 [2024-10-31 22:02:25,823 INFO L431 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 [2024-10-31 22:02:25,827 INFO L432 NwaCegarLoop]: 76 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, 76 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 [2024-10-31 22:02:25,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-31 22:02:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-31 22:02:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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) [2024-10-31 22:02:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-10-31 22:02:25,878 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 114 [2024-10-31 22:02:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:25,879 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-31 22:02:25,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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) [2024-10-31 22:02:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-10-31 22:02:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-31 22:02:25,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:25,884 INFO L215 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, 1, 1] [2024-10-31 22:02:25,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:02:25,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:25,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1975372663, now seen corresponding path program 1 times [2024-10-31 22:02:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653872987] [2024-10-31 22:02:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:02:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:02:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:02:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:02:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:02:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:02:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:02:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:02:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:02:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:02:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:02:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:02:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:02:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:02:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:02:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:02:26,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:26,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653872987] [2024-10-31 22:02:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653872987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:26,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:26,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:26,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992970386] [2024-10-31 22:02:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:26,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:26,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:26,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:26,701 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2024-10-31 22:02:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:26,765 INFO L93 Difference]: Finished difference Result 101 states and 149 transitions. [2024-10-31 22:02:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:26,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 114 [2024-10-31 22:02:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:26,768 INFO L225 Difference]: With dead ends: 101 [2024-10-31 22:02:26,769 INFO L226 Difference]: Without dead ends: 52 [2024-10-31 22:02:26,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:26,772 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:26,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-31 22:02:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-31 22:02:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 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) [2024-10-31 22:02:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-31 22:02:26,789 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 114 [2024-10-31 22:02:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:26,794 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-31 22:02:26,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2024-10-31 22:02:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-31 22:02:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:02:26,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:26,800 INFO L215 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, 1, 1, 1] [2024-10-31 22:02:26,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:02:26,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:26,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash 237839506, now seen corresponding path program 1 times [2024-10-31 22:02:26,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:26,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360502358] [2024-10-31 22:02:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:02:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:02:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:02:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:02:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:02:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:02:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:02:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:02:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:02:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:02:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:02:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:02:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:02:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:02:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:02:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:02:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360502358] [2024-10-31 22:02:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360502358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:29,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:02:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311616915] [2024-10-31 22:02:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:29,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:02:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:02:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:02:29,049 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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) [2024-10-31 22:02:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:29,365 INFO L93 Difference]: Finished difference Result 126 states and 177 transitions. [2024-10-31 22:02:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:02:29,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 115 [2024-10-31 22:02:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:29,368 INFO L225 Difference]: With dead ends: 126 [2024-10-31 22:02:29,368 INFO L226 Difference]: Without dead ends: 77 [2024-10-31 22:02:29,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:02:29,370 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:29,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 365 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:02:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-31 22:02:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2024-10-31 22:02:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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) [2024-10-31 22:02:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-10-31 22:02:29,386 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 115 [2024-10-31 22:02:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:29,387 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-10-31 22:02:29,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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) [2024-10-31 22:02:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-10-31 22:02:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:02:29,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:29,391 INFO L215 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, 1, 1, 1, 1] [2024-10-31 22:02:29,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:02:29,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:29,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1117785961, now seen corresponding path program 1 times [2024-10-31 22:02:29,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:29,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362851009] [2024-10-31 22:02:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:02:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:02:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:02:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:02:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:02:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:02:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:02:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:02:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:02:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:02:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:02:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:02:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:02:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:02:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:02:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:02:29,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:29,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362851009] [2024-10-31 22:02:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362851009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:29,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:29,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:29,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061824164] [2024-10-31 22:02:29,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:29,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:29,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:29,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:29,572 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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) [2024-10-31 22:02:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:29,610 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2024-10-31 22:02:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:29,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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 116 [2024-10-31 22:02:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:29,616 INFO L225 Difference]: With dead ends: 136 [2024-10-31 22:02:29,616 INFO L226 Difference]: Without dead ends: 74 [2024-10-31 22:02:29,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:29,618 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:29,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-31 22:02:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2024-10-31 22:02:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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) [2024-10-31 22:02:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2024-10-31 22:02:29,632 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 116 [2024-10-31 22:02:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2024-10-31 22:02:29,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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) [2024-10-31 22:02:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2024-10-31 22:02:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:02:29,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:29,637 INFO L215 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, 1, 1, 1, 1] [2024-10-31 22:02:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:02:29,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:29,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1175044263, now seen corresponding path program 1 times [2024-10-31 22:02:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857614563] [2024-10-31 22:02:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:02:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:02:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:02:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:02:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:02:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:02:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:02:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:02:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:02:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:02:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:02:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:02:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:02:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:02:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:02:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:02:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857614563] [2024-10-31 22:02:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857614563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:32,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:32,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:02:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193359433] [2024-10-31 22:02:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:32,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:02:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:32,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:02:32,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:02:32,138 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-10-31 22:02:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:32,549 INFO L93 Difference]: Finished difference Result 148 states and 194 transitions. [2024-10-31 22:02:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:02:32,550 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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 116 [2024-10-31 22:02:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:32,554 INFO L225 Difference]: With dead ends: 148 [2024-10-31 22:02:32,554 INFO L226 Difference]: Without dead ends: 86 [2024-10-31 22:02:32,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:02:32,560 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 33 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:32,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 399 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:02:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-31 22:02:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2024-10-31 22:02:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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) [2024-10-31 22:02:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2024-10-31 22:02:32,577 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 116 [2024-10-31 22:02:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:32,578 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2024-10-31 22:02:32,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-10-31 22:02:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2024-10-31 22:02:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:02:32,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:32,580 INFO L215 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, 1, 1, 1, 1] [2024-10-31 22:02:32,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:02:32,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:32,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:32,581 INFO L85 PathProgramCache]: Analyzing trace with hash -473979685, now seen corresponding path program 1 times [2024-10-31 22:02:32,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:32,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327007920] [2024-10-31 22:02:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:02:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:02:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:02:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:02:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:02:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:02:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:02:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:02:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:02:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:02:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:02:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:02:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:02:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:02:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:02:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:02:35,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:35,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327007920] [2024-10-31 22:02:35,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327007920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:35,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:35,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:02:35,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489946958] [2024-10-31 22:02:35,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:35,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:02:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:02:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:02:35,202 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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) [2024-10-31 22:02:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:35,552 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2024-10-31 22:02:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:02:35,553 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 116 [2024-10-31 22:02:35,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:35,554 INFO L225 Difference]: With dead ends: 91 [2024-10-31 22:02:35,555 INFO L226 Difference]: Without dead ends: 89 [2024-10-31 22:02:35,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:02:35,557 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 56 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:35,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 296 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:02:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-31 22:02:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2024-10-31 22:02:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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) [2024-10-31 22:02:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2024-10-31 22:02:35,573 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 116 [2024-10-31 22:02:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:35,574 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2024-10-31 22:02:35,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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) [2024-10-31 22:02:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2024-10-31 22:02:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:02:35,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:35,575 INFO L215 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, 1, 1, 1, 1] [2024-10-31 22:02:35,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:02:35,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:35,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash 331312688, now seen corresponding path program 1 times [2024-10-31 22:02:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:35,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164309352] [2024-10-31 22:02:35,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:35,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:35,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:35,722 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:02:35,723 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:02:35,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:02:35,728 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:35,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:02:35,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:02:35 BoogieIcfgContainer [2024-10-31 22:02:35,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:02:35,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:02:35,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:02:35,839 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:02:35,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:24" (3/4) ... [2024-10-31 22:02:35,842 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:02:35,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:02:35,843 INFO L158 Benchmark]: Toolchain (without parser) took 12283.05ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 127.0MB in the beginning and 86.8MB in the end (delta: 40.2MB). Peak memory consumption was 155.6MB. Max. memory is 16.1GB. [2024-10-31 22:02:35,844 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:02:35,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.89ms. Allocated memory is still 155.2MB. Free memory was 126.8MB in the beginning and 113.5MB in the end (delta: 13.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-31 22:02:35,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.05ms. Allocated memory is still 155.2MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:35,845 INFO L158 Benchmark]: Boogie Preprocessor took 58.46ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 107.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:02:35,845 INFO L158 Benchmark]: RCFGBuilder took 757.48ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 112.4MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-31 22:02:35,845 INFO L158 Benchmark]: TraceAbstraction took 10893.22ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 111.4MB in the beginning and 87.9MB in the end (delta: 23.6MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. [2024-10-31 22:02:35,846 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 270.5MB. Free memory was 87.9MB in the beginning and 86.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:35,848 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.19ms. Allocated memory is still 121.6MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.89ms. Allocated memory is still 155.2MB. Free memory was 126.8MB in the beginning and 113.5MB in the end (delta: 13.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.05ms. Allocated memory is still 155.2MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.46ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 107.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 757.48ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 112.4MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10893.22ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 111.4MB in the beginning and 87.9MB in the end (delta: 23.6MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 270.5MB. Free memory was 87.9MB in the beginning and 86.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 5; [L23] unsigned char var_1_6 = 1; [L24] signed long int var_1_7 = 0; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] signed long int var_1_12 = 15; [L29] signed long int var_1_13 = 1; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] signed long int var_1_16 = 16; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] signed long int last_1_var_1_12 = 15; VAL [isInitial=0, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L77] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L80] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L80] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L83] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L83] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L84] var_1_13 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L86] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L86] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L88] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L92] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L92] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L93] var_1_16 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L95] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L95] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L96] var_1_18 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L97] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L98] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L98] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=253] [L112] RET updateVariables() [L113] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L48] COND TRUE var_1_19 > var_1_9 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L49] COND TRUE \read(var_1_6) [L50] var_1_12 = (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=508, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L69] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((signed long int) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((signed long int) (var_1_13 - var_1_16))) : (var_1_12 == ((signed long int) var_1_16)))) : (var_1_12 == ((signed long int) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=254, var_1_9=253] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 1420 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 977 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 443 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=5, InterpolantAutomatonStates: 39, 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, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 685 ConstructedInterpolants, 0 QuantifiedInterpolants, 2191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3672/3672 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:02:35,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU --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 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:38,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:38,468 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:02:38,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:38,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:38,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:38,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:38,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:38,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:38,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:38,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:38,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:38,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:38,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:38,522 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:38,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:38,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:02:38,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:38,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:38,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:38,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:02:38,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:38,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:02:38,531 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:02:38,532 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:02:38,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:38,532 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:02:38,532 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:38,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:02:38,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:38,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:38,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:38,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:38,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:38,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:38,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:38,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:38,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:02:38,537 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:02:38,537 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:02:38,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:38,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:38,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:38,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:38,539 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:02:38,539 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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b [2024-10-31 22:02:39,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:39,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:39,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:39,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:39,101 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:39,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i Unable to find full path for "g++" [2024-10-31 22:02:41,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:41,624 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:41,625 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2024-10-31 22:02:41,636 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/data/21ba83749/6fd0c32f15ea46179b6d205b3e866320/FLAGd3e61adcc [2024-10-31 22:02:41,914 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/data/21ba83749/6fd0c32f15ea46179b6d205b3e866320 [2024-10-31 22:02:41,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:41,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:41,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:41,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:41,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:41,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:41" (1/1) ... [2024-10-31 22:02:41,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5fe8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:41, skipping insertion in model container [2024-10-31 22:02:41,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:41" (1/1) ... [2024-10-31 22:02:41,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:42,175 WARN L251 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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2024-10-31 22:02:42,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:42,257 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:42,272 WARN L251 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_7678bcbd-d3ab-4b53-8a71-ef357cc60130/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2024-10-31 22:02:42,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:42,370 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:42,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42 WrapperNode [2024-10-31 22:02:42,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:42,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:42,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:42,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:42,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,436 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-31 22:02:42,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:42,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:42,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:42,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:42,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,469 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:02:42,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:42,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:42,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:42,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:42,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (1/1) ... [2024-10-31 22:02:42,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:42,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:42,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:02:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:02:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:02:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:42,657 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:42,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:44,356 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-31 22:02:44,357 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:44,370 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:44,370 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:02:44,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:44 BoogieIcfgContainer [2024-10-31 22:02:44,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:44,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:44,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:44,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:44,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:41" (1/3) ... [2024-10-31 22:02:44,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dec87d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:44, skipping insertion in model container [2024-10-31 22:02:44,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:42" (2/3) ... [2024-10-31 22:02:44,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dec87d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:44, skipping insertion in model container [2024-10-31 22:02:44,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:44" (3/3) ... [2024-10-31 22:02:44,380 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2024-10-31 22:02:44,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:44,401 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:02:44,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:44,471 INFO L333 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, 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;@24a08e34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:44,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:02:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 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) [2024-10-31 22:02:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-31 22:02:44,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:44,490 INFO L215 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, 1, 1] [2024-10-31 22:02:44,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:44,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash 912981449, now seen corresponding path program 1 times [2024-10-31 22:02:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:44,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795736695] [2024-10-31 22:02:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:44,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:02:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:44,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:02:44,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:02:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:44,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:02:44,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:02:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-31 22:02:44,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:02:44,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:02:44,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795736695] [2024-10-31 22:02:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795736695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440691935] [2024-10-31 22:02:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:44,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:02:44,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:02:44,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:02:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:02:44,855 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-31 22:02:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:44,894 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2024-10-31 22:02:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:02:44,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-10-31 22:02:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:44,912 INFO L225 Difference]: With dead ends: 105 [2024-10-31 22:02:44,912 INFO L226 Difference]: Without dead ends: 52 [2024-10-31 22:02:44,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:02:44,918 INFO L432 NwaCegarLoop]: 76 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, 76 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 [2024-10-31 22:02:44,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-31 22:02:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-31 22:02:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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) [2024-10-31 22:02:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-10-31 22:02:44,980 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 114 [2024-10-31 22:02:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:44,981 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-31 22:02:44,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-31 22:02:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-10-31 22:02:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-31 22:02:44,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:44,985 INFO L215 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, 1, 1] [2024-10-31 22:02:44,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:02:45,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:02:45,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:45,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:45,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1975372663, now seen corresponding path program 1 times [2024-10-31 22:02:45,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:45,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759208605] [2024-10-31 22:02:45,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:45,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:02:45,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:45,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:02:45,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:02:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:45,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:02:45,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:02:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:02:45,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:02:45,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:02:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759208605] [2024-10-31 22:02:45,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759208605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:45,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:45,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:02:45,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604821314] [2024-10-31 22:02:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:45,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:02:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:02:45,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:02:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:02:45,584 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-10-31 22:02:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:46,088 INFO L93 Difference]: Finished difference Result 137 states and 204 transitions. [2024-10-31 22:02:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:02:46,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 114 [2024-10-31 22:02:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:46,095 INFO L225 Difference]: With dead ends: 137 [2024-10-31 22:02:46,095 INFO L226 Difference]: Without dead ends: 88 [2024-10-31 22:02:46,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:46,097 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 68 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:46,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 258 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:02:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-31 22:02:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2024-10-31 22:02:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 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) [2024-10-31 22:02:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-31 22:02:46,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 114 [2024-10-31 22:02:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:46,114 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-31 22:02:46,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-10-31 22:02:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-31 22:02:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:02:46,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:46,117 INFO L215 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, 1, 1, 1] [2024-10-31 22:02:46,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-31 22:02:46,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:02:46,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:46,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 237839506, now seen corresponding path program 1 times [2024-10-31 22:02:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81987075] [2024-10-31 22:02:46,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:46,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:02:46,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:46,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:02:46,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-31 22:02:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:46,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:46,628 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-31 22:02:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1255837466] [2024-10-31 22:02:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:46,629 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 22:02:46,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 [2024-10-31 22:02:46,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 22:02:46,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7678bcbd-d3ab-4b53-8a71-ef357cc60130/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-31 22:02:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:46,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 22:02:46,928 INFO L278 TraceCheckSpWp]: Computing forward predicates...