./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-5.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_variablewrapping_normal_file-5.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', 'd86a29590e516b56eb6eeb16b945b1182b90f7fb3c3ac4e2538897e0203b1d47'] 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_variablewrapping_normal_file-5.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 d86a29590e516b56eb6eeb16b945b1182b90f7fb3c3ac4e2538897e0203b1d47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:02:48,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:02:48,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:02:48,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:02:48,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:02:48,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:02:48,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:02:48,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:02:48,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:02:48,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:02:48,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:02:48,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:02:48,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:02:48,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:02:48,670 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:02:48,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:02:48,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:02:48,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:02:48,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:02:48,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:02:48,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:02:48,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:02:48,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:02:48,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:02:48,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:02:48,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:02:48,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:02:48,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:02:48,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:02:48,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:02:48,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:02:48,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:02:48,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:02:48,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:02:48,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:02:48,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:02:48,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:02:48,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:02:48,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:02:48,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:02:48,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:02:48,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:02:48,674 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 -> d86a29590e516b56eb6eeb16b945b1182b90f7fb3c3ac4e2538897e0203b1d47 [2024-11-07 10:02:48,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:02:48,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:02:48,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:02:48,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:02:48,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:02:48,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-5.i [2024-11-07 10:02:50,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:02:50,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:02:50,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-5.i [2024-11-07 10:02:50,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4afd1f73b/12181beb5e73401d904d1c69dc5c08a5/FLAG23225ec56 [2024-11-07 10:02:50,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4afd1f73b/12181beb5e73401d904d1c69dc5c08a5 [2024-11-07 10:02:50,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:02:50,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:02:50,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:02:50,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:02:50,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:02:50,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1964d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50, skipping insertion in model container [2024-11-07 10:02:50,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:02:50,711 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_variablewrapping_normal_file-5.i[912,925] [2024-11-07 10:02:50,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:02:50,755 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:02:50,764 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_variablewrapping_normal_file-5.i[912,925] [2024-11-07 10:02:50,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:02:50,801 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:02:50,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50 WrapperNode [2024-11-07 10:02:50,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:02:50,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:02:50,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:02:50,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:02:50,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,871 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-07 10:02:50,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:02:50,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:02:50,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:02:50,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:02:50,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,919 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 10:02:50,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:02:50,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:02:50,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:02:50,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:02:50,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (1/1) ... [2024-11-07 10:02:50,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:02:50,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:02:50,991 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 10:02:50,998 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 10:02:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:02:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:02:51,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:02:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:02:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:02:51,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:02:51,105 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:02:51,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:02:51,457 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 10:02:51,458 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:02:51,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:02:51,472 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:02:51,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:51 BoogieIcfgContainer [2024-11-07 10:02:51,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:02:51,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:02:51,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:02:51,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:02:51,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:02:50" (1/3) ... [2024-11-07 10:02:51,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7ccd25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:51, skipping insertion in model container [2024-11-07 10:02:51,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:50" (2/3) ... [2024-11-07 10:02:51,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7ccd25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:51, skipping insertion in model container [2024-11-07 10:02:51,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:51" (3/3) ... [2024-11-07 10:02:51,482 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-5.i [2024-11-07 10:02:51,497 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:02:51,498 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:02:51,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:02:51,572 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;@1a8a81cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:02:51,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:02:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:02:51,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:51,604 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:51,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:51,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 929324851, now seen corresponding path program 1 times [2024-11-07 10:02:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:51,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61804800] [2024-11-07 10:02:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:02:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:02:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:02:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:02:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:02:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:02:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:02:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:02:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:02:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:02:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:02:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:02:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 10:02:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:02:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 10:02:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:02:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:02:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 10:02:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 10:02:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 10:02:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:02:52,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:02:52,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61804800] [2024-11-07 10:02:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61804800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:02:52,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:02:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:02:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986366714] [2024-11-07 10:02:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:02:52,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:02:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:02:52,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:02:52,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:02:52,044 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:02:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:02:52,071 INFO L93 Difference]: Finished difference Result 103 states and 178 transitions. [2024-11-07 10:02:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:02:52,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2024-11-07 10:02:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:02:52,081 INFO L225 Difference]: With dead ends: 103 [2024-11-07 10:02:52,082 INFO L226 Difference]: Without dead ends: 51 [2024-11-07 10:02:52,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 10:02:52,088 INFO L432 NwaCegarLoop]: 75 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, 75 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 10:02:52,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:02:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-07 10:02:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-07 10:02:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-07 10:02:52,133 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 123 [2024-11-07 10:02:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:02:52,133 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-07 10:02:52,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:02:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-07 10:02:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:02:52,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:52,139 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:52,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:02:52,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:52,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1217728759, now seen corresponding path program 1 times [2024-11-07 10:02:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:52,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903725997] [2024-11-07 10:02:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:02:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:02:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:02:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:02:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:02:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:02:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:02:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:02:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:02:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:02:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:02:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:02:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 10:02:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:02:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 10:02:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:02:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:02:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 10:02:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 10:02:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 10:02:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:02:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:02:55,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903725997] [2024-11-07 10:02:55,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903725997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:02:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:02:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:02:55,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541777928] [2024-11-07 10:02:55,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:02:55,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:02:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:02:55,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:02:55,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:02:55,765 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:02:56,704 INFO L93 Difference]: Finished difference Result 92 states and 124 transitions. [2024-11-07 10:02:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:02:56,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-11-07 10:02:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:02:56,708 INFO L225 Difference]: With dead ends: 92 [2024-11-07 10:02:56,710 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 10:02:56,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:02:56,711 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 59 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:02:56,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 399 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:02:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 10:02:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2024-11-07 10:02:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:02:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2024-11-07 10:02:56,737 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 123 [2024-11-07 10:02:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:02:56,738 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2024-11-07 10:02:56,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2024-11-07 10:02:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:02:56,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:56,740 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:56,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:02:56,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:56,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:56,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1274987061, now seen corresponding path program 1 times [2024-11-07 10:02:56,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:56,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396955365] [2024-11-07 10:02:56,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:56,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:02:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:02:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:02:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:02:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:02:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:02:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:02:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:02:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:02:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:02:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:02:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:02:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 10:02:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:02:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 10:02:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:02:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:02:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 10:02:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 10:02:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 10:02:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:02:56,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:02:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396955365] [2024-11-07 10:02:56,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396955365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:02:56,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:02:56,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:02:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853552150] [2024-11-07 10:02:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:02:56,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:02:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:02:56,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:02:56,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:02:56,925 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:02:56,945 INFO L93 Difference]: Finished difference Result 141 states and 200 transitions. [2024-11-07 10:02:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:02:56,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-11-07 10:02:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:02:56,949 INFO L225 Difference]: With dead ends: 141 [2024-11-07 10:02:56,949 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 10:02:56,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 10:02:56,951 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:02:56,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:02:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 10:02:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-07 10:02:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 44 states have internal predecessors, (49), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:02:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2024-11-07 10:02:56,970 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 123 [2024-11-07 10:02:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:02:56,971 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2024-11-07 10:02:56,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2024-11-07 10:02:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:02:56,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:56,975 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:56,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:02:56,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:56,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:56,978 INFO L85 PathProgramCache]: Analyzing trace with hash 453110410, now seen corresponding path program 1 times [2024-11-07 10:02:56,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:56,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431751578] [2024-11-07 10:02:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:56,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:03:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:03:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:03:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:03:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:03:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:03:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:03:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:03:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:03:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:03:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:03:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:03:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 10:03:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:03:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 10:03:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:03:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:03:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 10:03:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 10:03:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 10:03:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:03:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:03:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431751578] [2024-11-07 10:03:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431751578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:03:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:03:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:03:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180040856] [2024-11-07 10:03:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:03:00,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:03:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:03:00,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:03:00,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:03:00,380 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:03:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:03:01,622 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-07 10:03:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:03:01,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2024-11-07 10:03:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:03:01,624 INFO L225 Difference]: With dead ends: 75 [2024-11-07 10:03:01,624 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 10:03:01,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:03:01,625 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 30 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:03:01,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 428 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:03:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 10:03:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 10:03:01,629 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 10:03:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 10:03:01,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2024-11-07 10:03:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:03:01,629 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 10:03:01,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:03:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 10:03:01,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 10:03:01,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:03:01,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:03:01,637 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 10:03:01,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 10:03:03,844 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:03:03,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:03:03 BoogieIcfgContainer [2024-11-07 10:03:03,881 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:03:03,882 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:03:03,882 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:03:03,882 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:03:03,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:51" (3/4) ... [2024-11-07 10:03:03,885 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 10:03:03,890 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 10:03:03,896 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 10:03:03,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 10:03:03,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 10:03:03,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 10:03:03,981 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 10:03:03,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 10:03:03,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:03:03,983 INFO L158 Benchmark]: Toolchain (without parser) took 13406.90ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 91.7MB in the beginning and 156.7MB in the end (delta: -65.0MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-11-07 10:03:03,983 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:03:03,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.26ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 78.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:03:03,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.54ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:03:03,985 INFO L158 Benchmark]: Boogie Preprocessor took 76.04ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 70.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:03:03,985 INFO L158 Benchmark]: RCFGBuilder took 523.20ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 51.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:03:03,986 INFO L158 Benchmark]: TraceAbstraction took 12405.89ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 51.2MB in the beginning and 162.2MB in the end (delta: -110.9MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-11-07 10:03:03,986 INFO L158 Benchmark]: Witness Printer took 100.28ms. Allocated memory is still 260.0MB. Free memory was 162.2MB in the beginning and 156.7MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:03:03,988 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.17ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.26ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 78.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.54ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.04ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 70.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 523.20ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 51.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12405.89ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 51.2MB in the beginning and 162.2MB in the end (delta: -110.9MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * Witness Printer took 100.28ms. Allocated memory is still 260.0MB. Free memory was 162.2MB in the beginning and 156.7MB in the end (delta: 5.5MB). 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, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 1045 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 724 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 321 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 1586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 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: 108]: Loop Invariant Derived loop invariant: ((((var_1_9 == 0) && (((((((var_1_15 * 65535) + var_1_8) + var_1_16) % 65536) == var_1_13) || (var_1_16 < (var_1_17 + 1))) || (((2 % var_1_15) * (var_1_8 / var_1_14)) < var_1_12))) && (((var_1_17 < var_1_16) || (((2 % var_1_15) * (var_1_8 / var_1_14)) < var_1_12)) || (((((var_1_15 * 65535) + var_1_8) + var_1_17) % 65536) == var_1_13))) || ((((((((((long long) var_1_18 + 4) == 0) && (var_1_1 == 0)) && (var_1_8 == var_1_19)) && (0 <= 0)) && (var_1_20 == var_1_12)) && (((((((var_1_15 * 65535) + var_1_8) + var_1_16) % 65536) == var_1_13) || (var_1_16 < (var_1_17 + 1))) || (((2 % var_1_15) * (var_1_8 / var_1_14)) < var_1_12))) && (var_1_8 == var_1_12)) && (((var_1_17 < var_1_16) || (((2 % var_1_15) * (var_1_8 / var_1_14)) < var_1_12)) || (((((var_1_15 * 65535) + var_1_8) + var_1_17) % 65536) == var_1_13)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (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_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20))) && (last_1_var_1_13 == \old(last_1_var_1_13))) && (last_1_var_1_20 == \old(last_1_var_1_20))) RESULT: Ultimate proved your program to be correct! [2024-11-07 10:03:04,045 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