./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX --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 66787726949481a4f01caef79c3e8fdad3a573b5b9ad657da2a70c5a83f1feb5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:04:46,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:04:46,467 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:04:46,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:04:46,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:04:46,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:04:46,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:04:46,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:04:46,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:04:46,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:04:46,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:04:46,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:04:46,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:04:46,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:04:46,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:04:46,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:04:46,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:04:46,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:04:46,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:04:46,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:04:46,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:04:46,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:04:46,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:04:46,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:04:46,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:04:46,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:04:46,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:04:46,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:04:46,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:04:46,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:04:46,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:04:46,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:04:46,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:04:46,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:04:46,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:04:46,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:04:46,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:04:46,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:04:46,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:04:46,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:04:46,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:04:46,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:04:46,553 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_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/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_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX 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 -> 66787726949481a4f01caef79c3e8fdad3a573b5b9ad657da2a70c5a83f1feb5 [2024-11-08 19:04:46,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:04:46,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:04:46,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:04:46,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:04:46,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:04:46,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i Unable to find full path for "g++" [2024-11-08 19:04:49,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:04:49,710 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:04:49,711 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i [2024-11-08 19:04:49,720 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/data/b7ad80d09/602f67d9cb09456882aacf477ef87b26/FLAG1173f1d1f [2024-11-08 19:04:50,017 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/data/b7ad80d09/602f67d9cb09456882aacf477ef87b26 [2024-11-08 19:04:50,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:04:50,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:04:50,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:04:50,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:04:50,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:04:50,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522ff19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50, skipping insertion in model container [2024-11-08 19:04:50,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:04:50,324 WARN L250 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_4afc859e-ebe7-44b5-bf36-60c056690112/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i[915,928] [2024-11-08 19:04:50,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:04:50,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:04:50,430 WARN L250 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_4afc859e-ebe7-44b5-bf36-60c056690112/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i[915,928] [2024-11-08 19:04:50,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:04:50,483 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:04:50,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50 WrapperNode [2024-11-08 19:04:50,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:04:50,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:04:50,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:04:50,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:04:50,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,555 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-11-08 19:04:50,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:04:50,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:04:50,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:04:50,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:04:50,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,600 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-11-08 19:04:50,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:04:50,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:04:50,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:04:50,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:04:50,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (1/1) ... [2024-11-08 19:04:50,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:04:50,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:04:50,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:04:50,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:04:50,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:04:50,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:04:50,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:04:50,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:04:50,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:04:50,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:04:50,803 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:04:50,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:04:51,037 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 19:04:51,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:04:51,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:04:51,055 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:04:51,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:04:51 BoogieIcfgContainer [2024-11-08 19:04:51,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:04:51,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:04:51,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:04:51,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:04:51,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:04:50" (1/3) ... [2024-11-08 19:04:51,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72de6d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:04:51, skipping insertion in model container [2024-11-08 19:04:51,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:04:50" (2/3) ... [2024-11-08 19:04:51,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72de6d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:04:51, skipping insertion in model container [2024-11-08 19:04:51,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:04:51" (3/3) ... [2024-11-08 19:04:51,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-43.i [2024-11-08 19:04:51,092 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:04:51,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:04:51,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:04:51,180 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;@c94bf65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:04:51,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:04:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 19:04:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 19:04:51,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:04:51,201 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:04:51,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:04:51,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:04:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash -333709800, now seen corresponding path program 1 times [2024-11-08 19:04:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:04:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480787501] [2024-11-08 19:04:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:04:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:04:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:04:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:04:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:04:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:04:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:04:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:04:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:04:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:04:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:04:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:04:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 19:04:52,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:04:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480787501] [2024-11-08 19:04:52,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480787501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:04:52,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:04:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:04:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958084326] [2024-11-08 19:04:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:04:52,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:04:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:04:52,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:04:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:04:52,953 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:04:53,165 INFO L93 Difference]: Finished difference Result 83 states and 132 transitions. [2024-11-08 19:04:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:04:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-08 19:04:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:04:53,182 INFO L225 Difference]: With dead ends: 83 [2024-11-08 19:04:53,182 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 19:04:53,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:04:53,192 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:04:53,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:04:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 19:04:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2024-11-08 19:04:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 19:04:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-08 19:04:53,253 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-08 19:04:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:04:53,258 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-08 19:04:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-08 19:04:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 19:04:53,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:04:53,271 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:04:53,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:04:53,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:04:53,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:04:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -331862758, now seen corresponding path program 1 times [2024-11-08 19:04:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:04:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845665995] [2024-11-08 19:04:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:04:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:04:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:04:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:04:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:04:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:04:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:04:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:04:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:04:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:04:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:04:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:04:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 19:04:53,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:04:53,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845665995] [2024-11-08 19:04:53,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845665995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:04:53,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:04:53,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:04:53,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319057710] [2024-11-08 19:04:53,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:04:53,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:04:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:04:53,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:04:53,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:04:53,892 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:04:54,094 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-08 19:04:54,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:04:54,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-08 19:04:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:04:54,098 INFO L225 Difference]: With dead ends: 48 [2024-11-08 19:04:54,098 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 19:04:54,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:04:54,101 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:04:54,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 219 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:04:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 19:04:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2024-11-08 19:04:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 19:04:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-08 19:04:54,119 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-08 19:04:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:04:54,122 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-08 19:04:54,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-08 19:04:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 19:04:54,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:04:54,125 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:04:54,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:04:54,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:04:54,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:04:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash -89900256, now seen corresponding path program 1 times [2024-11-08 19:04:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:04:54,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463798265] [2024-11-08 19:04:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:04:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:04:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:04:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:04:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:04:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:04:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:04:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:04:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:04:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:04:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:04:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:04:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 19:04:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:04:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463798265] [2024-11-08 19:04:54,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463798265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:04:54,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:04:54,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:04:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784879874] [2024-11-08 19:04:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:04:54,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:04:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:04:54,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:04:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:04:54,672 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:04:54,836 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-11-08 19:04:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:04:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-08 19:04:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:04:54,841 INFO L225 Difference]: With dead ends: 45 [2024-11-08 19:04:54,843 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 19:04:54,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:04:54,845 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:04:54,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 235 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:04:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 19:04:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2024-11-08 19:04:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 19:04:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-08 19:04:54,865 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-08 19:04:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:04:54,866 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-08 19:04:54,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-08 19:04:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 19:04:54,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:04:54,872 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:04:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:04:54,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:04:54,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:04:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1274346081, now seen corresponding path program 1 times [2024-11-08 19:04:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:04:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847686154] [2024-11-08 19:04:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:04:54,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:04:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:04:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:04:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:04:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:04:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:04:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:04:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:04:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:04:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:04:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:04:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 19:04:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:04:55,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847686154] [2024-11-08 19:04:55,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847686154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:04:55,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:04:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:04:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627701874] [2024-11-08 19:04:55,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:04:55,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:04:55,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:04:55,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:04:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:04:55,202 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:04:55,328 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-11-08 19:04:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:04:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-08 19:04:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:04:55,330 INFO L225 Difference]: With dead ends: 51 [2024-11-08 19:04:55,330 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 19:04:55,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:04:55,332 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:04:55,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 221 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:04:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 19:04:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2024-11-08 19:04:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 19:04:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-08 19:04:55,349 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 67 [2024-11-08 19:04:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:04:55,351 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-08 19:04:55,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-08 19:04:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 19:04:55,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:04:55,353 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:04:55,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:04:55,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:04:55,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:04:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1272499039, now seen corresponding path program 1 times [2024-11-08 19:04:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:04:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131225004] [2024-11-08 19:04:55,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:04:55,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:04:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:04:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:04:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:04:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:04:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:04:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:04:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:04:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:04:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:04:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:04:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:04:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 19:04:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:04:55,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131225004] [2024-11-08 19:04:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131225004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:04:55,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:04:55,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:04:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12838996] [2024-11-08 19:04:55,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:04:55,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:04:55,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:04:55,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:04:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:04:55,915 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:04:56,093 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-11-08 19:04:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:04:56,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-08 19:04:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:04:56,095 INFO L225 Difference]: With dead ends: 46 [2024-11-08 19:04:56,095 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 19:04:56,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:04:56,097 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:04:56,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 208 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:04:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 19:04:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 19:04:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:04:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 19:04:56,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-08 19:04:56,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:04:56,100 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 19:04:56,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 19:04:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 19:04:56,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:04:56,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:04:56,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:04:56,109 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 19:04:56,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 19:04:56,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:04:56,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:04:56 BoogieIcfgContainer [2024-11-08 19:04:56,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:04:56,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:04:56,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:04:56,177 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:04:56,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:04:51" (3/4) ... [2024-11-08 19:04:56,181 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:04:56,187 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 19:04:56,194 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-08 19:04:56,195 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 19:04:56,196 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 19:04:56,196 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 19:04:56,302 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 19:04:56,302 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 19:04:56,302 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:04:56,303 INFO L158 Benchmark]: Toolchain (without parser) took 6278.08ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 105.1MB in the beginning and 97.2MB in the end (delta: 7.9MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2024-11-08 19:04:56,306 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 140.5MB. Free memory was 113.2MB in the beginning and 113.1MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:04:56,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.82ms. Allocated memory is still 140.5MB. Free memory was 105.1MB in the beginning and 91.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:04:56,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.95ms. Allocated memory is still 140.5MB. Free memory was 91.6MB in the beginning and 90.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:04:56,307 INFO L158 Benchmark]: Boogie Preprocessor took 69.85ms. Allocated memory is still 140.5MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:04:56,307 INFO L158 Benchmark]: RCFGBuilder took 429.51ms. Allocated memory is still 140.5MB. Free memory was 88.0MB in the beginning and 75.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:04:56,307 INFO L158 Benchmark]: TraceAbstraction took 5116.16ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 74.8MB in the beginning and 102.5MB in the end (delta: -27.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-08 19:04:56,307 INFO L158 Benchmark]: Witness Printer took 126.22ms. Allocated memory is still 188.7MB. Free memory was 102.5MB in the beginning and 97.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:04:56,309 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.41ms. Allocated memory is still 140.5MB. Free memory was 113.2MB in the beginning and 113.1MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.82ms. Allocated memory is still 140.5MB. Free memory was 105.1MB in the beginning and 91.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.95ms. Allocated memory is still 140.5MB. Free memory was 91.6MB in the beginning and 90.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.85ms. Allocated memory is still 140.5MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.51ms. Allocated memory is still 140.5MB. Free memory was 88.0MB in the beginning and 75.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5116.16ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 74.8MB in the beginning and 102.5MB in the end (delta: -27.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 126.22ms. Allocated memory is still 188.7MB. Free memory was 102.5MB in the beginning and 97.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 818 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 246 mSDtfsCounter, 193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 31, 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, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-11-08 19:04:56,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4afc859e-ebe7-44b5-bf36-60c056690112/bin/uautomizer-verify-jihMAELWvX/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 Writing output log to file Ultimate.log Result: TRUE