./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.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_fillercode_fillercodesize_normal_file-98.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', '2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c'] 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_fillercode_fillercodesize_normal_file-98.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 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:39:34,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:39:34,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:39:34,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:39:34,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:39:34,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:39:34,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:39:34,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:39:34,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:39:34,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:39:34,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:39:34,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:39:34,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:39:34,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:39:34,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:39:34,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:39:34,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:39:34,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:39:34,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:39:34,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:39:34,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:39:34,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:39:34,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:39:34,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:39:34,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:39:34,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:39:34,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:39:34,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:39:34,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:39:34,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:39:34,744 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 -> 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c [2024-11-07 04:39:35,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:39:35,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:39:35,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:39:35,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:39:35,058 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:39:35,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-07 04:39:36,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:39:36,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:39:36,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-07 04:39:36,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/635c10366/0bcce709e90345df831ef5427964e581/FLAG7bb5bc138 [2024-11-07 04:39:36,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/635c10366/0bcce709e90345df831ef5427964e581 [2024-11-07 04:39:36,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:39:36,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:39:36,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:39:36,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:39:36,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:39:36,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:36,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d231769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36, skipping insertion in model container [2024-11-07 04:39:36,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:36,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:39:36,763 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_fillercode_fillercodesize_normal_file-98.i[913,926] [2024-11-07 04:39:36,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:39:36,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:39:36,861 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_fillercode_fillercodesize_normal_file-98.i[913,926] [2024-11-07 04:39:36,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:39:36,906 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:39:36,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36 WrapperNode [2024-11-07 04:39:36,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:39:36,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:39:36,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:39:36,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:39:36,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:36,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:36,983 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-07 04:39:36,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:39:36,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:39:36,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:39:36,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:39:36,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:36,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,035 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 04:39:37,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:39:37,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:39:37,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:39:37,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:39:37,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (1/1) ... [2024-11-07 04:39:37,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:39:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:39:37,109 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 04:39:37,117 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 04:39:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:39:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:39:37,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:39:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:39:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:39:37,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:39:37,224 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:39:37,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:39:37,694 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 04:39:37,695 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:39:37,705 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:39:37,707 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:39:37,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:39:37 BoogieIcfgContainer [2024-11-07 04:39:37,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:39:37,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:39:37,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:39:37,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:39:37,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:39:36" (1/3) ... [2024-11-07 04:39:37,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5c9eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:39:37, skipping insertion in model container [2024-11-07 04:39:37,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:36" (2/3) ... [2024-11-07 04:39:37,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5c9eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:39:37, skipping insertion in model container [2024-11-07 04:39:37,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:39:37" (3/3) ... [2024-11-07 04:39:37,717 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-07 04:39:37,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:39:37,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:39:37,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:39:37,819 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;@68ff0868, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:39:37,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:39:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 04:39:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 04:39:37,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:39:37,844 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:37,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:39:37,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:39:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -784140647, now seen corresponding path program 1 times [2024-11-07 04:39:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:39:37,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927433100] [2024-11-07 04:39:37,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:39:37,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:39:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:39:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:39:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:39:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:39:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:39:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 04:39:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:39:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:39:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:39:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:39:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:39:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:39:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:39:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:39:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:39:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:39:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:39:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:39:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:39:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:39:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:39:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:39:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:39:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:39:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 04:39:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:39:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927433100] [2024-11-07 04:39:39,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927433100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:39:39,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:39:39,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:39:39,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960415860] [2024-11-07 04:39:39,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:39:39,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:39:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:39:39,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:39:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:39:39,847 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:39:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:39:39,970 INFO L93 Difference]: Finished difference Result 185 states and 339 transitions. [2024-11-07 04:39:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:39:39,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-07 04:39:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:39:39,980 INFO L225 Difference]: With dead ends: 185 [2024-11-07 04:39:39,981 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 04:39:39,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:39:39,986 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 98 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:39:39,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 222 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:39:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 04:39:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2024-11-07 04:39:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 04:39:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-11-07 04:39:40,047 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 153 [2024-11-07 04:39:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:39:40,048 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-11-07 04:39:40,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:39:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-11-07 04:39:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 04:39:40,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:39:40,055 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:40,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:39:40,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:39:40,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:39:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash -525975209, now seen corresponding path program 1 times [2024-11-07 04:39:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:39:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514497344] [2024-11-07 04:39:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:39:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:39:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:39:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:39:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:39:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:39:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:39:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 04:39:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:39:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:39:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:39:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:39:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:39:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:39:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:39:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:39:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:39:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:44,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:39:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:39:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:39:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:39:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:39:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:39:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:39:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:39:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:39:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:39:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 04:39:45,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:39:45,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514497344] [2024-11-07 04:39:45,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514497344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:39:45,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:39:45,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:39:45,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069168748] [2024-11-07 04:39:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:39:45,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:39:45,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:39:45,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:39:45,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:39:45,037 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:39:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:39:45,652 INFO L93 Difference]: Finished difference Result 249 states and 374 transitions. [2024-11-07 04:39:45,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:39:45,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-07 04:39:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:39:45,658 INFO L225 Difference]: With dead ends: 249 [2024-11-07 04:39:45,658 INFO L226 Difference]: Without dead ends: 182 [2024-11-07 04:39:45,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:39:45,661 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 266 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:39:45,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 262 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 04:39:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-07 04:39:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2024-11-07 04:39:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 107 states have internal predecessors, (135), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 04:39:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 267 transitions. [2024-11-07 04:39:45,721 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 267 transitions. Word has length 153 [2024-11-07 04:39:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:39:45,722 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 267 transitions. [2024-11-07 04:39:45,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:39:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 267 transitions. [2024-11-07 04:39:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 04:39:45,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:39:45,725 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:45,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:39:45,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:39:45,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:39:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1249032153, now seen corresponding path program 1 times [2024-11-07 04:39:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:39:45,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402157543] [2024-11-07 04:39:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:39:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:39:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:40:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:40:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:40:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:40:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:40:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 04:40:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:40:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:40:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:40:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:40:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:40:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:40:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:40:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:40:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:40:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:40:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:40:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:40:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:40:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:40:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:40:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:40:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:40:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:40:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 04:40:30,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:40:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402157543] [2024-11-07 04:40:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402157543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:40:30,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:40:30,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 04:40:30,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100425437] [2024-11-07 04:40:30,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:40:30,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 04:40:30,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:40:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 04:40:30,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:40:30,775 INFO L87 Difference]: Start difference. First operand 176 states and 267 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:40:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:40:31,612 INFO L93 Difference]: Finished difference Result 378 states and 570 transitions. [2024-11-07 04:40:31,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 04:40:31,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-07 04:40:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:40:31,619 INFO L225 Difference]: With dead ends: 378 [2024-11-07 04:40:31,619 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 04:40:31,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:40:31,621 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 52 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:40:31,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 480 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 04:40:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 04:40:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 198. [2024-11-07 04:40:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 128 states have (on average 1.28125) internal successors, (164), 129 states have internal predecessors, (164), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 04:40:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 296 transitions. [2024-11-07 04:40:31,655 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 296 transitions. Word has length 153 [2024-11-07 04:40:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:40:31,656 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 296 transitions. [2024-11-07 04:40:31,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:40:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 296 transitions. [2024-11-07 04:40:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 04:40:31,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:40:31,658 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:31,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:40:31,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:40:31,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:40:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1745962159, now seen corresponding path program 1 times [2024-11-07 04:40:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:40:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550952224] [2024-11-07 04:40:31,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:40:31,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:40:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:40:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:40:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:40:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:40:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:40:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 04:40:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:40:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:40:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:40:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:40:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:40:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:40:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:40:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:40:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:40:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:40:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:40:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:40:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:40:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:40:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:40:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:40:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:40:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:40:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:40:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 04:40:34,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:40:34,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550952224] [2024-11-07 04:40:34,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550952224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:40:34,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:40:34,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 04:40:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715381311] [2024-11-07 04:40:34,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:40:34,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 04:40:34,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:40:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 04:40:34,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 04:40:34,366 INFO L87 Difference]: Start difference. First operand 198 states and 296 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 04:40:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:40:36,112 INFO L93 Difference]: Finished difference Result 612 states and 924 transitions. [2024-11-07 04:40:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 04:40:36,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2024-11-07 04:40:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:40:36,118 INFO L225 Difference]: With dead ends: 612 [2024-11-07 04:40:36,118 INFO L226 Difference]: Without dead ends: 417 [2024-11-07 04:40:36,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:40:36,120 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 303 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:40:36,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 719 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 04:40:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-07 04:40:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 366. [2024-11-07 04:40:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 227 states have (on average 1.277533039647577) internal successors, (290), 229 states have internal predecessors, (290), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-07 04:40:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 554 transitions. [2024-11-07 04:40:36,196 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 554 transitions. Word has length 153 [2024-11-07 04:40:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:40:36,196 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 554 transitions. [2024-11-07 04:40:36,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 04:40:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 554 transitions. [2024-11-07 04:40:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 04:40:36,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:40:36,206 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:36,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:40:36,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:40:36,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:40:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash 29045203, now seen corresponding path program 1 times [2024-11-07 04:40:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:40:36,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716582241] [2024-11-07 04:40:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:40:36,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:40:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat