./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b14a474bb0ff17f6a3a6ae227e2568fd910f01f9a72dd1e72a28558eb21922c7'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 b14a474bb0ff17f6a3a6ae227e2568fd910f01f9a72dd1e72a28558eb21922c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:28:50,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:28:51,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:28:51,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:28:51,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:28:51,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:28:51,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:28:51,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:28:51,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:28:51,121 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:28:51,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:28:51,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:28:51,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:28:51,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:28:51,122 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:28:51,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:28:51,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:28:51,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:28:51,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:28:51,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:28:51,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:28:51,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:28:51,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:28:51,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:28:51,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:28:51,125 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> b14a474bb0ff17f6a3a6ae227e2568fd910f01f9a72dd1e72a28558eb21922c7 [2024-11-07 09:28:51,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:28:51,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:28:51,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:28:51,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:28:51,433 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:28:51,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i [2024-11-07 09:28:52,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:28:52,928 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:28:52,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i [2024-11-07 09:28:52,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c360e0272/14b31928b2654f2898a9a184139c65e5/FLAGa81f1b087 [2024-11-07 09:28:52,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c360e0272/14b31928b2654f2898a9a184139c65e5 [2024-11-07 09:28:52,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:28:52,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:28:52,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:28:52,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:28:52,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:28:52,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:28:52" (1/1) ... [2024-11-07 09:28:52,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172f1f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:52, skipping insertion in model container [2024-11-07 09:28:52,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:28:52" (1/1) ... [2024-11-07 09:28:52,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:28:53,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i[915,928] [2024-11-07 09:28:53,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:28:53,161 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:28:53,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-27.i[915,928] [2024-11-07 09:28:53,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:28:53,207 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:28:53,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53 WrapperNode [2024-11-07 09:28:53,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:28:53,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:28:53,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:28:53,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:28:53,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,281 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-07 09:28:53,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:28:53,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:28:53,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:28:53,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:28:53,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,326 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-07 09:28:53,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:28:53,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:28:53,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:28:53,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:28:53,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (1/1) ... [2024-11-07 09:28:53,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:28:53,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:28:53,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:28:53,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:28:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:28:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:28:53,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:28:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:28:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:28:53,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:28:53,510 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:28:53,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:28:53,827 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 09:28:53,831 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:28:53,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:28:53,847 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:28:53,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:28:53 BoogieIcfgContainer [2024-11-07 09:28:53,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:28:53,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:28:53,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:28:53,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:28:53,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:28:52" (1/3) ... [2024-11-07 09:28:53,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e3cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:28:53, skipping insertion in model container [2024-11-07 09:28:53,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:28:53" (2/3) ... [2024-11-07 09:28:53,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e3cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:28:53, skipping insertion in model container [2024-11-07 09:28:53,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:28:53" (3/3) ... [2024-11-07 09:28:53,863 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-27.i [2024-11-07 09:28:53,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:28:53,880 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:28:53,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:28:53,960 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;@6d4a1828, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:28:53,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:28:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 09:28:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 09:28:53,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:28:53,979 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:28:53,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:28:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:28:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1601827997, now seen corresponding path program 1 times [2024-11-07 09:28:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:28:53,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665025779] [2024-11-07 09:28:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:28:53,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:28:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:28:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:28:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:28:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:28:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:28:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:28:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:28:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:28:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:28:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:28:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:28:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:28:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:28:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:28:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:28:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:28:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:28:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 09:28:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:28:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665025779] [2024-11-07 09:28:54,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665025779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:28:54,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:28:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:28:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591144745] [2024-11-07 09:28:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:28:54,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:28:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:28:54,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:28:54,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:28:54,335 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 09:28:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:28:54,361 INFO L93 Difference]: Finished difference Result 93 states and 157 transitions. [2024-11-07 09:28:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:28:54,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-11-07 09:28:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:28:54,370 INFO L225 Difference]: With dead ends: 93 [2024-11-07 09:28:54,370 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 09:28:54,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-11-07 09:28:54,378 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:28:54,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:28:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 09:28:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 09:28:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 09:28:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-07 09:28:54,422 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 107 [2024-11-07 09:28:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:28:54,423 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-07 09:28:54,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 09:28:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-07 09:28:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 09:28:54,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:28:54,426 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:28:54,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:28:54,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:28:54,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:28:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1732167579, now seen corresponding path program 1 times [2024-11-07 09:28:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:28:54,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839269294] [2024-11-07 09:28:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:28:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:28:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:28:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:28:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:28:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:28:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:28:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:28:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:28:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:28:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:28:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:28:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:28:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:28:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:28:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:28:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:28:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:28:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:28:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:28:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 09:28:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:28:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839269294] [2024-11-07 09:28:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839269294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:28:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:28:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:28:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070683024] [2024-11-07 09:28:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:28:57,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:28:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:28:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:28:57,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:28:57,990 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 09:28:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:28:59,083 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2024-11-07 09:28:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 09:28:59,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-07 09:28:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:28:59,087 INFO L225 Difference]: With dead ends: 137 [2024-11-07 09:28:59,087 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 09:28:59,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 09:28:59,091 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 09:28:59,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 325 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 09:28:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 09:28:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2024-11-07 09:28:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 09:28:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-07 09:28:59,123 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-07 09:28:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:28:59,123 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-07 09:28:59,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 09:28:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-07 09:28:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 09:28:59,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:28:59,126 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:28:59,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:28:59,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:28:59,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:28:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash 42839783, now seen corresponding path program 1 times [2024-11-07 09:28:59,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:28:59,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343880497] [2024-11-07 09:28:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:28:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:28:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:29:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 09:29:00,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:00,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343880497] [2024-11-07 09:29:00,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343880497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:00,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:00,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 09:29:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378619511] [2024-11-07 09:29:00,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:00,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:29:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:29:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:29:00,327 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 09:29:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:00,910 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2024-11-07 09:29:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 09:29:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-07 09:29:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:00,916 INFO L225 Difference]: With dead ends: 133 [2024-11-07 09:29:00,917 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 09:29:00,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 09:29:00,918 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:00,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 352 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:29:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 09:29:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2024-11-07 09:29:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 09:29:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-07 09:29:00,938 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-07 09:29:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:00,939 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-07 09:29:00,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 09:29:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-07 09:29:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 09:29:00,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:00,942 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 09:29:00,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:29:00,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:00,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:00,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1052109209, now seen corresponding path program 1 times [2024-11-07 09:29:00,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:00,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251955178] [2024-11-07 09:29:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:00,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:29:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 09:29:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251955178] [2024-11-07 09:29:01,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251955178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:01,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:29:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421451171] [2024-11-07 09:29:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:01,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:29:01,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:01,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:29:01,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:29:01,150 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 09:29:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:01,286 INFO L93 Difference]: Finished difference Result 193 states and 276 transitions. [2024-11-07 09:29:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:29:01,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-07 09:29:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:01,289 INFO L225 Difference]: With dead ends: 193 [2024-11-07 09:29:01,289 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 09:29:01,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:01,293 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 54 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:01,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 245 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:29:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 09:29:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-07 09:29:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 09:29:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-07 09:29:01,317 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 107 [2024-11-07 09:29:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:01,317 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-07 09:29:01,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 09:29:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-07 09:29:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 09:29:01,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:01,325 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:01,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:29:01,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:01,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1905129425, now seen corresponding path program 1 times [2024-11-07 09:29:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975809179] [2024-11-07 09:29:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:29:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 09:29:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 09:29:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 09:29:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 09:29:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 09:29:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 09:29:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 09:29:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 09:29:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 09:29:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 09:29:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 09:29:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 09:29:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 09:29:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 09:29:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-07 09:29:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 09:29:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 09:29:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2279 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2024-11-07 09:29:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975809179] [2024-11-07 09:29:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975809179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:29:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330624195] [2024-11-07 09:29:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:01,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:29:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:29:01,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:29:01,636 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-07 09:29:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:01,758 INFO L93 Difference]: Finished difference Result 133 states and 191 transitions. [2024-11-07 09:29:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:29:01,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2024-11-07 09:29:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:01,763 INFO L225 Difference]: With dead ends: 133 [2024-11-07 09:29:01,763 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:29:01,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:01,769 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:01,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:29:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:29:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:29:01,773 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-07 09:29:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:29:01,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2024-11-07 09:29:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:01,774 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:29:01,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-07 09:29:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:29:01,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:29:01,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:29:01,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:29:01,781 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 09:29:01,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:29:01,894 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:29:01,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:29:01 BoogieIcfgContainer [2024-11-07 09:29:01,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:29:01,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:29:01,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:29:01,921 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:29:01,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:28:53" (3/4) ... [2024-11-07 09:29:01,924 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:29:01,930 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:29:01,935 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 09:29:01,936 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 09:29:01,936 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:29:01,936 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:29:02,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:29:02,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:29:02,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:29:02,021 INFO L158 Benchmark]: Toolchain (without parser) took 9063.13ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.8MB in the beginning and 140.6MB in the end (delta: -48.8MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-07 09:29:02,021 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:29:02,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.12ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:29:02,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.37ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.0MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:29:02,022 INFO L158 Benchmark]: Boogie Preprocessor took 72.53ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 74.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:29:02,022 INFO L158 Benchmark]: RCFGBuilder took 493.47ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 58.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:29:02,023 INFO L158 Benchmark]: TraceAbstraction took 8069.55ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 58.0MB in the beginning and 145.0MB in the end (delta: -87.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:29:02,023 INFO L158 Benchmark]: Witness Printer took 99.19ms. Allocated memory is still 201.3MB. Free memory was 145.0MB in the beginning and 140.6MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:29:02,025 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.71ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.12ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.37ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.0MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.53ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 74.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 493.47ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 58.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8069.55ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 58.0MB in the beginning and 145.0MB in the end (delta: -87.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 99.19ms. Allocated memory is still 201.3MB. Free memory was 145.0MB in the beginning and 140.6MB in the end (delta: 4.4MB). There was no memory consumed. 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 5, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 764 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 300 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=2, InterpolantAutomatonStates: 40, 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, 78 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 2113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4455/4455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) Ensures: (((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (last_1_var_1_9 == \old(last_1_var_1_9))) && (last_1_var_1_13 == \old(last_1_var_1_13)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:29:02,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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